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 --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Sandman01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:27:55,329 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:27:55,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:27:55,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:27:55,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:27:55,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:27:55,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:27:55,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:27:55,355 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:27:55,356 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:27:55,357 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:27:55,357 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:27:55,358 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:27:55,359 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:27:55,360 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:27:55,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:27:55,362 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:27:55,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:27:55,366 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:27:55,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:27:55,369 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:27:55,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:27:55,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:27:55,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:27:55,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:27:55,374 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:27:55,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:27:55,376 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:27:55,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:27:55,377 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:27:55,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:27:55,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:27:55,380 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:27:55,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:27:55,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:27:55,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:27:55,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:27:55,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:27:55,383 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:27:55,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:27:55,425 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:27:55,431 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:27:55,433 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:27:55,434 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:27:55,435 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Sandman01.bpl [2019-05-15 10:27:55,436 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Sandman01.bpl' [2019-05-15 10:27:55,482 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:27:55,483 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-05-15 10:27:55,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:27:55,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:27:55,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:27:55,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,522 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:27:55,522 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:27:55,523 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:27:55,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:27:55,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:27:55,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:27:55,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:27:55,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/1) ... [2019-05-15 10:27:55,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:27:55,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:27:55,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:27:55,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:27:55,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:27:55,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-05-15 10:27:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-05-15 10:27:55,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-05-15 10:27:55,909 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:27:55,909 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:27:55,910 INFO L202 PluginConnector]: Adding new model Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:27:55 BoogieIcfgContainer [2019-05-15 10:27:55,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:27:55,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:27:55,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:27:55,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:27:55,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:27:55" (1/2) ... [2019-05-15 10:27:55,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4384a2e2 and model type Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:27:55, skipping insertion in model container [2019-05-15 10:27:55,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:27:55" (2/2) ... [2019-05-15 10:27:55,919 INFO L109 eAbstractionObserver]: Analyzing ICFG Sandman01.bpl [2019-05-15 10:27:55,929 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:27:55,939 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:27:55,958 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:27:55,988 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:27:55,989 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:27:55,989 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:27:55,989 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:27:55,989 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:27:55,989 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:27:55,990 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:27:55,990 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:27:55,990 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:27:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-05-15 10:27:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:27:56,017 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:27:56,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:27:56,021 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:27:56,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:27:56,027 INFO L82 PathProgramCache]: Analyzing trace with hash 924803, now seen corresponding path program 1 times [2019-05-15 10:27:56,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:27:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:27:56,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:27:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:27:56,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:27:56,320 INFO L375 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 6 treesize of output 5 [2019-05-15 10:27:56,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:56,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:56,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:27:56,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:27:56,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:56,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_13]. (= (store v_main_a_13 main_x 0) main_a) [2019-05-15 10:27:56,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:27:56,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:56,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:27:56,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:56,570 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:27:56,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:27:56,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:27:56,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:56,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_14]. (and (= 0 (select v_main_a_14 main_x)) (= (store v_main_a_14 main_y 1000) main_a)) [2019-05-15 10:27:56,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:27:56,782 INFO L273 TraceCheckUtils]: 0: Hoare triple {11#true} a := a[x := 0]; {16#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:27:56,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {16#(= (select main_a main_x) 0)} a := a[y := 1000]; {20#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:27:56,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {20#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume x > y && a[x] == 1000; {12#false} is VALID [2019-05-15 10:27:56,818 INFO L273 TraceCheckUtils]: 3: Hoare triple {12#false} assume !(a[y] <= 0); {12#false} is VALID [2019-05-15 10:27:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:27:56,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:27:56,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:27:56,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:27:56,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:27:56,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:27:56,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:27:56,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:27:56,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:27:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:27:56,900 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-05-15 10:27:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:57,080 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-05-15 10:27:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:27:57,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:27:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:27:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:27:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-05-15 10:27:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:27:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-05-15 10:27:57,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-05-15 10:27:57,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:27:57,137 INFO L225 Difference]: With dead ends: 11 [2019-05-15 10:27:57,138 INFO L226 Difference]: Without dead ends: 7 [2019-05-15 10:27:57,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:27:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-05-15 10:27:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-05-15 10:27:57,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:27:57,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-05-15 10:27:57,162 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:27:57,162 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:27:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:57,164 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:27:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:27:57,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:27:57,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:27:57,165 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:27:57,166 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:27:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:57,167 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:27:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:27:57,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:27:57,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:27:57,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:27:57,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:27:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:27:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-05-15 10:27:57,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-05-15 10:27:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:27:57,172 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-05-15 10:27:57,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:27:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:27:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-05-15 10:27:57,173 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:27:57,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-05-15 10:27:57,173 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:27:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:27:57,174 INFO L82 PathProgramCache]: Analyzing trace with hash 888582244, now seen corresponding path program 1 times [2019-05-15 10:27:57,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:27:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:27:57,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-15 10:27:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:27:57,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:27:57,247 INFO L375 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 6 treesize of output 5 [2019-05-15 10:27:57,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:57,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:57,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:27:57,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:27:57,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:57,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_15]. (= main_a (store v_main_a_15 main_x 0)) [2019-05-15 10:27:57,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:27:57,419 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-05-15 10:27:57,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:57,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:27:57,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:57,514 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:27:57,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:27:57,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:27:57,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:57,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_16]. (and (= (select v_main_a_16 main_x) 0) (= (store v_main_a_16 main_y 1000) main_a)) [2019-05-15 10:27:57,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:27:57,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:27:57,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:57,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:27:57,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:57,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:27:57,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:57,853 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:27:57,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:27:57,854 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:27:57,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:57,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_17]. (let ((.cse0 (select v_main_a_17 main_x))) (let ((.cse1 (= (select v_main_a_17 main_y) 1000)) (.cse2 (= main_a (store v_main_a_17 main_x (+ .cse0 1))))) (or (and (= .cse0 0) .cse1 .cse2) (and (= main_y main_x) .cse1 .cse2)))) [2019-05-15 10:27:57,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:27:57,987 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-15 10:27:58,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:27:58,336 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:58,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:27:58,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:58,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:27:58,354 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:58,405 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:27:58,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:27:58,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:27:58,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:58,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_18]. (let ((.cse2 (select v_main_a_18 main_y))) (let ((.cse0 (= main_a (store v_main_a_18 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_18 main_x))) (or (and .cse0 (= .cse1 1) (= 1000 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:27:58,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:27:58,529 INFO L273 TraceCheckUtils]: 0: Hoare triple {58#true} a := a[x := 0]; {63#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:27:58,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#(= (select main_a main_x) 0)} a := a[y := 1000]; {67#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:27:58,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {67#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {71#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:27:58,536 INFO L273 TraceCheckUtils]: 3: Hoare triple {71#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {75#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:27:58,537 INFO L273 TraceCheckUtils]: 4: Hoare triple {75#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {59#false} is VALID [2019-05-15 10:27:58,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#false} assume !(a[y] <= 0); {59#false} is VALID [2019-05-15 10:27:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:27:58,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:27:58,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-15 10:27:58,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-05-15 10:27:58,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:27:58,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:27:58,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:27:58,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:27:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:27:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:27:58,559 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-05-15 10:27:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:58,667 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:27:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-15 10:27:58,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-05-15 10:27:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:27:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:27:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-05-15 10:27:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:27:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-05-15 10:27:58,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2019-05-15 10:27:58,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:27:58,693 INFO L225 Difference]: With dead ends: 9 [2019-05-15 10:27:58,694 INFO L226 Difference]: Without dead ends: 9 [2019-05-15 10:27:58,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:27:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-05-15 10:27:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-05-15 10:27:58,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:27:58,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-05-15 10:27:58,697 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-05-15 10:27:58,697 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-05-15 10:27:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:58,698 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:27:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:27:58,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:27:58,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:27:58,699 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-05-15 10:27:58,699 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-05-15 10:27:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:58,701 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:27:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:27:58,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:27:58,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:27:58,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:27:58,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:27:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:27:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-05-15 10:27:58,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-05-15 10:27:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:27:58,704 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-05-15 10:27:58,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:27:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:27:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-05-15 10:27:58,705 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:27:58,705 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-05-15 10:27:58,705 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:27:58,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:27:58,706 INFO L82 PathProgramCache]: Analyzing trace with hash -771108859, now seen corresponding path program 2 times [2019-05-15 10:27:58,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:27:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:27:58,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-15 10:27:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:27:58,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:27:58,765 INFO L375 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 6 treesize of output 5 [2019-05-15 10:27:58,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:58,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:58,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:27:58,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:27:58,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:58,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_19]. (= (store v_main_a_19 main_x 0) main_a) [2019-05-15 10:27:58,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:27:58,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:58,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:27:58,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:58,869 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:27:58,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:27:58,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:27:58,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:58,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_20]. (and (= (store v_main_a_20 main_y 1000) main_a) (= (select v_main_a_20 main_x) 0)) [2019-05-15 10:27:58,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:27:58,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:27:58,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:27:58,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:27:58,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:59,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:27:59,048 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,103 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:27:59,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:27:59,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:27:59,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:59,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_21]. (let ((.cse2 (select v_main_a_21 main_x))) (let ((.cse0 (= (store v_main_a_21 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_21 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:27:59,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:27:59,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:27:59,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:59,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:27:59,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:27:59,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,268 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:27:59,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:27:59,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:27:59,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:59,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_22]. (let ((.cse1 (select v_main_a_22 main_y))) (let ((.cse0 (= (store v_main_a_22 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_22 main_x))) (or (and .cse0 (= 1000 .cse1) (= 1 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse2))))) [2019-05-15 10:27:59,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:27:59,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:27:59,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:59,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:27:59,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:27:59,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,454 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:27:59,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:27:59,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:27:59,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:59,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_23]. (let ((.cse0 (select v_main_a_23 main_x))) (let ((.cse1 (= (store v_main_a_23 main_x (+ .cse0 1)) main_a))) (or (and (= 1 .cse0) .cse1 (= 999 (select v_main_a_23 main_y))) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:27:59,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:27:59,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:27:59,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:27:59,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:27:59,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,550 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:59,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:27:59,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,599 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:27:59,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:27:59,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:27:59,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:59,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_24]. (let ((.cse2 (select v_main_a_24 main_y))) (let ((.cse1 (= (store v_main_a_24 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_24 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 999) .cse1 (= 2 .cse0))))) [2019-05-15 10:27:59,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:27:59,675 INFO L273 TraceCheckUtils]: 0: Hoare triple {117#true} a := a[x := 0]; {122#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:27:59,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {122#(= (select main_a main_x) 0)} a := a[y := 1000]; {126#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:27:59,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {126#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {130#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:27:59,680 INFO L273 TraceCheckUtils]: 3: Hoare triple {130#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {134#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:27:59,681 INFO L273 TraceCheckUtils]: 4: Hoare triple {134#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {138#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:27:59,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {138#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {142#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:27:59,691 INFO L273 TraceCheckUtils]: 6: Hoare triple {142#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {118#false} is VALID [2019-05-15 10:27:59,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {118#false} assume !(a[y] <= 0); {118#false} is VALID [2019-05-15 10:27:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:27:59,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:27:59,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-15 10:27:59,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-05-15 10:27:59,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:27:59,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-05-15 10:27:59,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:27:59,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-05-15 10:27:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-15 10:27:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-05-15 10:27:59,715 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-05-15 10:27:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:59,868 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:27:59,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-15 10:27:59,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-05-15 10:27:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:27:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:27:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-05-15 10:27:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:27:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-05-15 10:27:59,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 12 transitions. [2019-05-15 10:27:59,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:27:59,893 INFO L225 Difference]: With dead ends: 11 [2019-05-15 10:27:59,893 INFO L226 Difference]: Without dead ends: 11 [2019-05-15 10:27:59,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-05-15 10:27:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-05-15 10:27:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-05-15 10:27:59,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:27:59,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-05-15 10:27:59,897 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-05-15 10:27:59,897 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-05-15 10:27:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:59,898 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:27:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:27:59,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:27:59,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:27:59,899 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-05-15 10:27:59,899 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-05-15 10:27:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:27:59,900 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:27:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:27:59,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:27:59,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:27:59,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:27:59,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:27:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-05-15 10:27:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-05-15 10:27:59,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-05-15 10:27:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:27:59,902 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-05-15 10:27:59,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-05-15 10:27:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:27:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-05-15 10:27:59,903 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:27:59,903 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-05-15 10:27:59,903 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:27:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:27:59,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1993575270, now seen corresponding path program 3 times [2019-05-15 10:27:59,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:27:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:27:59,935 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:27:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:27:59,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:27:59,963 INFO L375 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 6 treesize of output 5 [2019-05-15 10:27:59,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:27:59,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:27:59,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:27:59,973 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:27:59,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_25]. (= (store v_main_a_25 main_x 0) main_a) [2019-05-15 10:27:59,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:00,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:00,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:00,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,034 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:00,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:00,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:00,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_26]. (and (= 0 (select v_main_a_26 main_x)) (= (store v_main_a_26 main_y 1000) main_a)) [2019-05-15 10:28:00,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:28:00,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:00,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:00,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:00,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:00,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:00,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,146 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:00,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:00,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:00,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:00,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_27]. (let ((.cse2 (select v_main_a_27 main_x))) (let ((.cse0 (= main_a (store v_main_a_27 main_x (+ .cse2 1)))) (.cse1 (= (select v_main_a_27 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:28:00,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:00,221 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:00,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:00,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:00,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:00,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:00,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,284 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:00,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:00,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:00,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:00,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_28]. (let ((.cse2 (select v_main_a_28 main_y))) (let ((.cse1 (select v_main_a_28 main_x)) (.cse0 (= (store v_main_a_28 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 1000 .cse2) (= .cse1 1) .cse0)))) [2019-05-15 10:28:00,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:00,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:00,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:00,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:00,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:00,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,493 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:00,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:00,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:00,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:00,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_29]. (let ((.cse1 (select v_main_a_29 main_x))) (let ((.cse0 (= (store v_main_a_29 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_29 main_y) 999) (= .cse1 1)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:28:00,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:00,549 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:00,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:00,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:00,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:00,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:00,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,665 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:00,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:00,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:00,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:00,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_30]. (let ((.cse2 (select v_main_a_30 main_y))) (let ((.cse0 (select v_main_a_30 main_x)) (.cse1 (= (store v_main_a_30 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 2) .cse1 (= .cse2 999))))) [2019-05-15 10:28:00,709 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:00,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:00,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:00,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:00,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:00,806 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,832 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:00,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:00,833 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:00,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:00,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_31]. (let ((.cse1 (select v_main_a_31 main_x))) (let ((.cse0 (= (store v_main_a_31 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_31 main_y) 998) (= 2 .cse1))))) [2019-05-15 10:28:00,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:00,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:00,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:00,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:00,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:00,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:00,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:00,973 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:00,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:00,974 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:01,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:01,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_32]. (let ((.cse2 (select v_main_a_32 main_y))) (let ((.cse1 (select v_main_a_32 main_x)) (.cse0 (= main_a (store v_main_a_32 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 3) .cse0 (= .cse2 998))))) [2019-05-15 10:28:01,008 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:01,044 INFO L273 TraceCheckUtils]: 0: Hoare triple {192#true} a := a[x := 0]; {197#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:01,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#(= (select main_a main_x) 0)} a := a[y := 1000]; {201#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:01,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {201#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {205#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:01,051 INFO L273 TraceCheckUtils]: 3: Hoare triple {205#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {209#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:01,052 INFO L273 TraceCheckUtils]: 4: Hoare triple {209#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {213#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:01,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {213#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {217#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:01,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {221#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:01,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {221#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {225#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:01,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {193#false} is VALID [2019-05-15 10:28:01,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {193#false} assume !(a[y] <= 0); {193#false} is VALID [2019-05-15 10:28:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:01,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:01,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-15 10:28:01,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-05-15 10:28:01,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:01,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-05-15 10:28:01,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:01,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-05-15 10:28:01,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-15 10:28:01,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-05-15 10:28:01,138 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-05-15 10:28:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:01,551 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-15 10:28:01,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-05-15 10:28:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-05-15 10:28:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-05-15 10:28:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-05-15 10:28:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-05-15 10:28:01,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 14 transitions. [2019-05-15 10:28:01,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:01,591 INFO L225 Difference]: With dead ends: 13 [2019-05-15 10:28:01,591 INFO L226 Difference]: Without dead ends: 13 [2019-05-15 10:28:01,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-05-15 10:28:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-05-15 10:28:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-05-15 10:28:01,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:01,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:01,594 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:01,594 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:01,595 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:01,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:01,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:01,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:01,595 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:01,596 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:01,597 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:01,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:01,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:01,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:01,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:28:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-05-15 10:28:01,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-05-15 10:28:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:01,599 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-05-15 10:28:01,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-05-15 10:28:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-05-15 10:28:01,600 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:01,600 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-05-15 10:28:01,600 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 270267015, now seen corresponding path program 4 times [2019-05-15 10:28:01,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:01,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-15 10:28:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:01,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:01,658 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:01,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:01,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:01,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:01,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:01,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:01,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_33]. (= (store v_main_a_33 main_x 0) main_a) [2019-05-15 10:28:01,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:01,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:01,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:01,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:01,720 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:01,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:01,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:01,725 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:01,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_34]. (and (= (select v_main_a_34 main_x) 0) (= (store v_main_a_34 main_y 1000) main_a)) [2019-05-15 10:28:01,726 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:28:01,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:01,798 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:01,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:01,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:01,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:01,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:01,842 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:01,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:01,843 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:01,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:01,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_35]. (let ((.cse2 (select v_main_a_35 main_x))) (let ((.cse0 (= (store v_main_a_35 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_35 main_y) 1000))) (or (and .cse0 .cse1 (= .cse2 0)) (and .cse0 (= main_y main_x) .cse1)))) [2019-05-15 10:28:01,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:01,966 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:01,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:01,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:01,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:02,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:02,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,133 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:02,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:02,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:02,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:02,217 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_36]. (let ((.cse2 (select v_main_a_36 main_y))) (let ((.cse0 (= (store v_main_a_36 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_36 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 1000) (= .cse1 1))))) [2019-05-15 10:28:02,217 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:02,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:02,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:02,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:02,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:02,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,322 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:02,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:02,323 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:02,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:02,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_37]. (let ((.cse1 (select v_main_a_37 main_x))) (let ((.cse0 (= (store v_main_a_37 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 1) .cse0 (= (select v_main_a_37 main_y) 999))))) [2019-05-15 10:28:02,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:02,395 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:02,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:02,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:02,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:02,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:02,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,459 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:02,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:02,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:02,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:02,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_38]. (let ((.cse2 (select v_main_a_38 main_y))) (let ((.cse1 (= (store v_main_a_38 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_38 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 2) (= .cse2 999))))) [2019-05-15 10:28:02,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:02,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:02,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:02,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:02,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:02,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,598 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:02,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:02,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:02,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:02,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_39]. (let ((.cse1 (select v_main_a_39 main_x))) (let ((.cse0 (= main_a (store v_main_a_39 main_x (+ .cse1 1))))) (or (and .cse0 (= 998 (select v_main_a_39 main_y)) (= 2 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:28:02,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:02,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:02,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:02,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:02,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:02,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,716 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:02,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:02,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:02,746 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:02,746 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_40]. (let ((.cse2 (select v_main_a_40 main_y))) (let ((.cse0 (= (store v_main_a_40 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_40 main_x))) (or (and .cse0 (= 3 .cse1) (= .cse2 998)) (and .cse0 (= main_y main_x) (= 1001 .cse1))))) [2019-05-15 10:28:02,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:02,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:02,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:02,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:02,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:02,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:02,862 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:02,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:02,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:02,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:02,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_41]. (let ((.cse0 (select v_main_a_41 main_x))) (let ((.cse1 (= (store v_main_a_41 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 3 .cse0) (= 997 (select v_main_a_41 main_y)))))) [2019-05-15 10:28:02,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:02,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:02,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:02,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:02,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:03,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:03,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,044 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:03,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:03,045 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:03,092 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:03,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_42]. (let ((.cse2 (select v_main_a_42 main_y))) (let ((.cse0 (= (store v_main_a_42 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_42 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= .cse2 997) (= 4 .cse1))))) [2019-05-15 10:28:03,092 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:03,127 INFO L273 TraceCheckUtils]: 0: Hoare triple {283#true} a := a[x := 0]; {288#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:03,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {288#(= (select main_a main_x) 0)} a := a[y := 1000]; {292#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:03,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {292#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {296#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:03,131 INFO L273 TraceCheckUtils]: 3: Hoare triple {296#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {300#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:03,132 INFO L273 TraceCheckUtils]: 4: Hoare triple {300#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {304#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:03,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {304#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {308#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:03,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {308#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {312#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:03,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {312#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {316#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:03,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {316#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {320#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:03,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {320#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {324#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:03,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {284#false} is VALID [2019-05-15 10:28:03,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {284#false} assume !(a[y] <= 0); {284#false} is VALID [2019-05-15 10:28:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:03,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:03,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-15 10:28:03,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-05-15 10:28:03,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:03,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-05-15 10:28:03,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:03,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-05-15 10:28:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-15 10:28:03,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-05-15 10:28:03,161 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-05-15 10:28:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:03,639 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:03,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-15 10:28:03,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-05-15 10:28:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-05-15 10:28:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-05-15 10:28:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-05-15 10:28:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-05-15 10:28:03,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 16 transitions. [2019-05-15 10:28:03,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:03,666 INFO L225 Difference]: With dead ends: 15 [2019-05-15 10:28:03,666 INFO L226 Difference]: Without dead ends: 15 [2019-05-15 10:28:03,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-05-15 10:28:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-05-15 10:28:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-05-15 10:28:03,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:03,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:03,669 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:03,669 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:03,670 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:03,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:03,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:03,671 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:03,671 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:03,672 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:03,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:03,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:03,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:03,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-05-15 10:28:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-05-15 10:28:03,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-05-15 10:28:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:03,674 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-05-15 10:28:03,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-05-15 10:28:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-05-15 10:28:03,675 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:03,675 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-05-15 10:28:03,675 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2028410216, now seen corresponding path program 5 times [2019-05-15 10:28:03,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:03,711 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-15 10:28:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:03,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:03,740 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:03,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:03,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:03,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:03,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_43]. (= (store v_main_a_43 main_x 0) main_a) [2019-05-15 10:28:03,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:03,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:03,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:03,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,807 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:03,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:03,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:03,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_44]. (and (= (store v_main_a_44 main_y 1000) main_a) (= (select v_main_a_44 main_x) 0)) [2019-05-15 10:28:03,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:03,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:03,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:03,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:03,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:03,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:03,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,893 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:03,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:03,894 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:03,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:03,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_45]. (let ((.cse2 (select v_main_a_45 main_x))) (let ((.cse0 (= (store v_main_a_45 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_45 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:28:03,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:03,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:03,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:03,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:03,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:03,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:03,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:03,989 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:03,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:03,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:04,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:04,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_46]. (let ((.cse2 (select v_main_a_46 main_y))) (let ((.cse0 (= main_a (store v_main_a_46 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_46 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 1) (= .cse2 1000))))) [2019-05-15 10:28:04,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:04,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:04,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:04,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:04,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:04,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,101 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:04,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:04,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:04,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:04,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_47]. (let ((.cse1 (select v_main_a_47 main_x))) (let ((.cse0 (= (store v_main_a_47 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 999 (select v_main_a_47 main_y)) (= 1 .cse1))))) [2019-05-15 10:28:04,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:04,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:04,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:04,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:04,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:04,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:04,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,241 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:04,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:04,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:04,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:04,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_48]. (let ((.cse2 (select v_main_a_48 main_y))) (let ((.cse0 (select v_main_a_48 main_x)) (.cse1 (= (store v_main_a_48 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 2) .cse1 (= .cse2 999))))) [2019-05-15 10:28:04,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:04,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:04,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:04,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:04,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:04,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,463 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:04,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:04,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:04,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:04,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_49]. (let ((.cse1 (select v_main_a_49 main_x))) (let ((.cse0 (= (store v_main_a_49 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_49 main_y) 998) .cse0 (= 2 .cse1))))) [2019-05-15 10:28:04,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:04,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:04,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:04,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:04,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:04,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,597 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:04,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:04,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:04,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:04,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_50]. (let ((.cse1 (select v_main_a_50 main_y))) (let ((.cse0 (select v_main_a_50 main_x)) (.cse2 (= (store v_main_a_50 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 3) (= .cse1 998) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:28:04,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:04,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:04,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:04,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:04,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:04,725 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,754 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:04,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:04,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:04,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:04,779 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_51]. (let ((.cse0 (select v_main_a_51 main_x))) (let ((.cse1 (= main_a (store v_main_a_51 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_51 main_y) 997) .cse1 (= .cse0 3))))) [2019-05-15 10:28:04,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:04,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:04,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:04,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:04,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:04,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:04,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:04,895 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:04,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:04,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:04,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:04,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_52]. (let ((.cse2 (select v_main_a_52 main_y))) (let ((.cse0 (select v_main_a_52 main_x)) (.cse1 (= main_a (store v_main_a_52 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 997) (= 4 .cse0) .cse1)))) [2019-05-15 10:28:04,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:05,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:05,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:05,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:05,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:05,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:05,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:05,072 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:05,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:05,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:05,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:05,083 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_53]. (let ((.cse1 (select v_main_a_53 main_x))) (let ((.cse0 (= (store v_main_a_53 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 4) .cse0 (= 996 (select v_main_a_53 main_y)))))) [2019-05-15 10:28:05,083 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:05,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:05,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:05,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:05,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:05,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:05,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:05,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:05,181 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:05,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:05,182 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:05,221 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:05,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_54]. (let ((.cse2 (select v_main_a_54 main_y))) (let ((.cse0 (select v_main_a_54 main_x)) (.cse1 (= (store v_main_a_54 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 5) (= 996 .cse2) .cse1)))) [2019-05-15 10:28:05,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:05,260 INFO L273 TraceCheckUtils]: 0: Hoare triple {390#true} a := a[x := 0]; {395#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:05,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {395#(= (select main_a main_x) 0)} a := a[y := 1000]; {399#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:05,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {403#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:05,270 INFO L273 TraceCheckUtils]: 3: Hoare triple {403#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {407#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:05,271 INFO L273 TraceCheckUtils]: 4: Hoare triple {407#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {411#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:05,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {411#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {415#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:05,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {415#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {419#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:05,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {423#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:05,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {423#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {427#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:05,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {427#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {431#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:05,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {431#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {435#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:05,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {435#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {439#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:05,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {439#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {391#false} is VALID [2019-05-15 10:28:05,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {391#false} assume !(a[y] <= 0); {391#false} is VALID [2019-05-15 10:28:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:05,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:05,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-15 10:28:05,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-05-15 10:28:05,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:05,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2019-05-15 10:28:05,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:05,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-05-15 10:28:05,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-15 10:28:05,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-05-15 10:28:05,308 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-05-15 10:28:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:05,859 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:05,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-15 10:28:05,860 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-05-15 10:28:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-05-15 10:28:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-05-15 10:28:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-05-15 10:28:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-05-15 10:28:05,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 18 transitions. [2019-05-15 10:28:05,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:05,889 INFO L225 Difference]: With dead ends: 17 [2019-05-15 10:28:05,889 INFO L226 Difference]: Without dead ends: 17 [2019-05-15 10:28:05,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-05-15 10:28:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-05-15 10:28:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-05-15 10:28:05,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:05,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:05,892 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:05,892 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:05,894 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:05,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:05,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:05,894 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:05,895 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:05,896 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:05,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:05,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:05,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:05,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-05-15 10:28:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-05-15 10:28:05,898 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-05-15 10:28:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:05,898 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-05-15 10:28:05,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-05-15 10:28:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-05-15 10:28:05,899 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:05,899 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-05-15 10:28:05,899 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash -613088247, now seen corresponding path program 6 times [2019-05-15 10:28:05,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:05,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-15 10:28:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:05,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:05,973 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:05,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:05,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:05,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:05,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:05,980 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:05,981 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_55]. (= (store v_main_a_55 main_x 0) main_a) [2019-05-15 10:28:05,981 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:06,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:06,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:06,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,038 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:06,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:06,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:06,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_56]. (and (= (store v_main_a_56 main_y 1000) main_a) (= 0 (select v_main_a_56 main_x))) [2019-05-15 10:28:06,042 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:06,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:06,091 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:06,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:06,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:06,105 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,132 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:06,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:06,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:06,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:06,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_57]. (let ((.cse1 (select v_main_a_57 main_x))) (let ((.cse0 (= main_a (store v_main_a_57 main_x (+ .cse1 1)))) (.cse2 (= (select v_main_a_57 main_y) 1000))) (or (and .cse0 (= 0 .cse1) .cse2) (and (= main_y main_x) .cse0 .cse2)))) [2019-05-15 10:28:06,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:06,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:06,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:06,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:06,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:06,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:06,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,256 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:06,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:06,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:06,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:06,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_58]. (let ((.cse2 (select v_main_a_58 main_y))) (let ((.cse0 (= (store v_main_a_58 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_58 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 1000) .cse0 (= .cse1 1))))) [2019-05-15 10:28:06,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:06,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:06,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:06,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:06,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:06,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,458 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:06,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:06,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:06,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:06,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_59]. (let ((.cse1 (select v_main_a_59 main_x))) (let ((.cse0 (= (store v_main_a_59 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_59 main_y) 999) .cse0 (= .cse1 1)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:28:06,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:06,547 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:06,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:06,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:06,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,583 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:06,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:06,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,653 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:06,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:06,654 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:06,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:06,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_60]. (let ((.cse2 (select v_main_a_60 main_y))) (let ((.cse1 (= (store v_main_a_60 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_60 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 999) (= .cse0 2))))) [2019-05-15 10:28:06,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:06,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:06,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:06,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:06,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:06,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,808 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:06,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:06,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:06,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:06,823 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_61]. (let ((.cse0 (select v_main_a_61 main_x))) (let ((.cse1 (= (store v_main_a_61 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 2) (= 998 (select v_main_a_61 main_y)))))) [2019-05-15 10:28:06,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:06,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:06,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:06,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:06,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:06,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:06,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:06,913 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:06,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:06,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:06,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:06,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_62]. (let ((.cse2 (select v_main_a_62 main_y))) (let ((.cse0 (select v_main_a_62 main_x)) (.cse1 (= (store v_main_a_62 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 3) .cse1 (= .cse2 998))))) [2019-05-15 10:28:06,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:07,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:07,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:07,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:07,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:07,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,057 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:07,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:07,058 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:07,070 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:07,070 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_63]. (let ((.cse1 (select v_main_a_63 main_x))) (let ((.cse0 (= (store v_main_a_63 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 3 .cse1) .cse0 (= (select v_main_a_63 main_y) 997))))) [2019-05-15 10:28:07,071 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:07,113 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:07,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:07,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:07,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,138 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:07,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:07,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,176 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:07,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:07,177 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:07,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:07,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_64]. (let ((.cse2 (select v_main_a_64 main_y))) (let ((.cse1 (select v_main_a_64 main_x)) (.cse0 (= (store v_main_a_64 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 997) (= .cse1 4) .cse0)))) [2019-05-15 10:28:07,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:07,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:07,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:07,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:07,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:07,317 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,472 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:28:07,472 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:07,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:07,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:07,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:07,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_65]. (let ((.cse0 (select v_main_a_65 main_x))) (let ((.cse1 (= main_a (store v_main_a_65 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 996 (select v_main_a_65 main_y)) (= 4 .cse0) .cse1)))) [2019-05-15 10:28:07,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:07,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:07,555 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:07,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:07,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:07,564 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,590 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:07,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:07,591 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:07,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:07,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_66]. (let ((.cse1 (select v_main_a_66 main_y))) (let ((.cse0 (= (store v_main_a_66 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_66 main_x))) (or (and .cse0 (= 996 .cse1) (= 5 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse2))))) [2019-05-15 10:28:07,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:07,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:07,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:07,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:07,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:07,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,849 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:07,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:07,850 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:07,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:07,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_67]. (let ((.cse1 (select v_main_a_67 main_x))) (let ((.cse0 (= (store v_main_a_67 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= 995 (select v_main_a_67 main_y)) (= .cse1 5))))) [2019-05-15 10:28:07,863 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:07,921 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:07,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:07,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:07,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:07,946 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:07,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:07,949 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:08,040 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:08,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:08,041 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:08,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:08,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_68]. (let ((.cse2 (select v_main_a_68 main_y))) (let ((.cse0 (= (store v_main_a_68 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_68 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 995 .cse2) .cse0 (= 6 .cse1))))) [2019-05-15 10:28:08,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:08,124 INFO L273 TraceCheckUtils]: 0: Hoare triple {513#true} a := a[x := 0]; {518#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:08,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {518#(= (select main_a main_x) 0)} a := a[y := 1000]; {522#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:08,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {522#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {526#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:08,128 INFO L273 TraceCheckUtils]: 3: Hoare triple {526#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {530#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:08,129 INFO L273 TraceCheckUtils]: 4: Hoare triple {530#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {534#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:08,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {534#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {538#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:08,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {538#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {542#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:08,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {542#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {546#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:08,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {550#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:08,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {550#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {554#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:08,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {554#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {558#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:08,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {558#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {562#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:08,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {562#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {566#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:08,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {570#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:08,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {570#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} assume x > y && a[x] == 1000; {514#false} is VALID [2019-05-15 10:28:08,150 INFO L273 TraceCheckUtils]: 15: Hoare triple {514#false} assume !(a[y] <= 0); {514#false} is VALID [2019-05-15 10:28:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:08,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:08,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-15 10:28:08,153 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-05-15 10:28:08,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:08,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-05-15 10:28:08,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:08,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-05-15 10:28:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-15 10:28:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-05-15 10:28:08,174 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-05-15 10:28:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:08,865 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:08,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-15 10:28:08,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-05-15 10:28:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-05-15 10:28:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-05-15 10:28:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-05-15 10:28:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-05-15 10:28:08,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 20 transitions. [2019-05-15 10:28:08,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:08,901 INFO L225 Difference]: With dead ends: 19 [2019-05-15 10:28:08,901 INFO L226 Difference]: Without dead ends: 19 [2019-05-15 10:28:08,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-05-15 10:28:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-05-15 10:28:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-05-15 10:28:08,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:08,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:08,905 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:08,905 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:08,906 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:08,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:08,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:08,907 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:08,907 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:08,909 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:08,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:08,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:08,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:08,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-05-15 10:28:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-05-15 10:28:08,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-05-15 10:28:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:08,911 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-05-15 10:28:08,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-05-15 10:28:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-05-15 10:28:08,912 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:08,912 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-05-15 10:28:08,912 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash -767439254, now seen corresponding path program 7 times [2019-05-15 10:28:08,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:08,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-15 10:28:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:08,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:09,067 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:09,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:09,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,117 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_69]. (= (store v_main_a_69 main_x 0) main_a) [2019-05-15 10:28:09,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:09,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:09,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,189 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:09,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:09,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_70]. (and (= 0 (select v_main_a_70 main_x)) (= (store v_main_a_70 main_y 1000) main_a)) [2019-05-15 10:28:09,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:09,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:09,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:09,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:09,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:09,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,341 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:09,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:09,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:09,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_71]. (let ((.cse2 (select v_main_a_71 main_x))) (let ((.cse0 (= 1000 (select v_main_a_71 main_y))) (.cse1 (= main_a (store v_main_a_71 main_x (+ .cse2 1))))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= 0 .cse2))))) [2019-05-15 10:28:09,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:09,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:09,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:09,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:09,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,447 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:09,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:09,448 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:09,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_72]. (let ((.cse0 (select v_main_a_72 main_y))) (let ((.cse1 (= (store v_main_a_72 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_72 main_x))) (or (and (= 1000 .cse0) .cse1 (= 1 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:28:09,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:09,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:09,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:09,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:09,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,592 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:09,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:09,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:09,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_73]. (let ((.cse0 (select v_main_a_73 main_x))) (let ((.cse1 (= (store v_main_a_73 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_73 main_y) 999) (= .cse0 1) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:28:09,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:09,639 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:09,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:09,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:09,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:09,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,714 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:09,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:09,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:09,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,740 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_74]. (let ((.cse2 (select v_main_a_74 main_y))) (let ((.cse1 (= (store v_main_a_74 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_74 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 2 .cse0) (= 999 .cse2))))) [2019-05-15 10:28:09,740 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:09,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:09,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:09,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,801 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:09,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,831 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:09,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:09,831 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:09,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_75]. (let ((.cse1 (select v_main_a_75 main_x))) (let ((.cse0 (= (store v_main_a_75 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= .cse1 2) (= (select v_main_a_75 main_y) 998))))) [2019-05-15 10:28:09,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:09,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:09,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:09,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:09,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:09,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,938 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:09,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:09,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:09,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,971 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_76]. (let ((.cse2 (select v_main_a_76 main_y))) (let ((.cse1 (= (store v_main_a_76 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_76 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= 998 .cse2) (= .cse0 3))))) [2019-05-15 10:28:09,971 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:10,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:10,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:10,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:10,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,070 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:10,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:10,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:10,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_77]. (let ((.cse0 (select v_main_a_77 main_x))) (let ((.cse1 (= (store v_main_a_77 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_77 main_y) 997) (= .cse0 3) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:28:10,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:10,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:10,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:10,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:10,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,205 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:10,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:10,206 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:10,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_78]. (let ((.cse2 (select v_main_a_78 main_y))) (let ((.cse0 (= (store v_main_a_78 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_78 main_x))) (or (and .cse0 (= .cse1 4) (= .cse2 997)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:28:10,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:10,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:10,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:10,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:10,296 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,333 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:10,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:10,333 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:10,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_79]. (let ((.cse0 (select v_main_a_79 main_x))) (let ((.cse1 (= main_a (store v_main_a_79 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_79 main_y) 996) .cse1 (= .cse0 4))))) [2019-05-15 10:28:10,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:10,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:10,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:10,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:10,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,439 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:10,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:10,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:10,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_80]. (let ((.cse1 (select v_main_a_80 main_y))) (let ((.cse0 (= (store v_main_a_80 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_80 main_x))) (or (and .cse0 (= 996 .cse1) (= 5 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:28:10,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:10,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:10,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:10,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:10,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,594 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:10,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:10,595 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:10,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_81]. (let ((.cse0 (select v_main_a_81 main_x))) (let ((.cse1 (= (store v_main_a_81 main_x (+ .cse0 1)) main_a))) (or (and (= 5 .cse0) (= 995 (select v_main_a_81 main_y)) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:28:10,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:10,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:10,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:10,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:10,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,723 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:10,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:10,723 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:10,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_82]. (let ((.cse2 (select v_main_a_82 main_y))) (let ((.cse1 (= (store v_main_a_82 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_82 main_x))) (or (and (= .cse0 6) .cse1 (= 995 .cse2)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:28:10,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:10,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:10,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:10,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:10,828 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,888 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:10,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:10,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:10,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_83]. (let ((.cse0 (select v_main_a_83 main_x))) (let ((.cse1 (= (store v_main_a_83 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 6) (= (select v_main_a_83 main_y) 994) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:28:10,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:10,946 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:10,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:10,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:10,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:10,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,002 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:11,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:11,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:11,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_84]. (let ((.cse2 (select v_main_a_84 main_y))) (let ((.cse1 (= (store v_main_a_84 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_84 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 994 .cse2) (= 7 .cse0))))) [2019-05-15 10:28:11,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:11,052 INFO L273 TraceCheckUtils]: 0: Hoare triple {652#true} a := a[x := 0]; {657#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:11,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {657#(= (select main_a main_x) 0)} a := a[y := 1000]; {661#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:11,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {661#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {665#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:11,056 INFO L273 TraceCheckUtils]: 3: Hoare triple {665#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {669#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:11,057 INFO L273 TraceCheckUtils]: 4: Hoare triple {669#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {673#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:11,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {673#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {677#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:11,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {677#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {681#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:11,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {681#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {685#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:11,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {685#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {689#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:11,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {689#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {693#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:11,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {693#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {697#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:11,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {697#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {701#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:11,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {701#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {705#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:11,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {709#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:11,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {709#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {713#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:11,071 INFO L273 TraceCheckUtils]: 15: Hoare triple {713#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {717#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:11,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {717#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} assume x > y && a[x] == 1000; {653#false} is VALID [2019-05-15 10:28:11,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {653#false} assume !(a[y] <= 0); {653#false} is VALID [2019-05-15 10:28:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:11,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:11,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-15 10:28:11,076 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-05-15 10:28:11,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:11,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2019-05-15 10:28:11,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:11,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-05-15 10:28:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-15 10:28:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-05-15 10:28:11,101 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-05-15 10:28:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,033 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-15 10:28:12,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-05-15 10:28:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-05-15 10:28:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-05-15 10:28:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-05-15 10:28:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-05-15 10:28:12,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 22 transitions. [2019-05-15 10:28:12,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:12,064 INFO L225 Difference]: With dead ends: 21 [2019-05-15 10:28:12,064 INFO L226 Difference]: Without dead ends: 21 [2019-05-15 10:28:12,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-05-15 10:28:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-05-15 10:28:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-05-15 10:28:12,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:12,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:12,067 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:12,067 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,069 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:12,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:12,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:12,069 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:12,069 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,070 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:12,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:12,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:12,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:12,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:28:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-15 10:28:12,072 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-05-15 10:28:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:12,072 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-05-15 10:28:12,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-05-15 10:28:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-05-15 10:28:12,073 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:12,073 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-05-15 10:28:12,074 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:12,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:12,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1225098379, now seen corresponding path program 8 times [2019-05-15 10:28:12,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:12,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-15 10:28:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:12,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:12,139 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:12,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:12,147 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_85]. (= main_a (store v_main_a_85 main_x 0)) [2019-05-15 10:28:12,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:12,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:12,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,190 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:12,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:12,193 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,193 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_86]. (and (= (store v_main_a_86 main_y 1000) main_a) (= (select v_main_a_86 main_x) 0)) [2019-05-15 10:28:12,193 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:12,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:12,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:12,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:12,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,273 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:12,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:12,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:12,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_87]. (let ((.cse1 (select v_main_a_87 main_x))) (let ((.cse0 (= (store v_main_a_87 main_x (+ .cse1 1)) main_a)) (.cse2 (= (select v_main_a_87 main_y) 1000))) (or (and .cse0 (= .cse1 0) .cse2) (and (= main_y main_x) .cse0 .cse2)))) [2019-05-15 10:28:12,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:12,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:12,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:12,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:12,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:12,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,366 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:12,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:12,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:12,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_88]. (let ((.cse2 (select v_main_a_88 main_y))) (let ((.cse0 (select v_main_a_88 main_x)) (.cse1 (= (store v_main_a_88 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 1) (= .cse2 1000) .cse1)))) [2019-05-15 10:28:12,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:12,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:12,472 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:12,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:12,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,521 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:12,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:12,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:12,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_89]. (let ((.cse1 (select v_main_a_89 main_x))) (let ((.cse0 (= main_a (store v_main_a_89 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 1) (= (select v_main_a_89 main_y) 999)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:28:12,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:12,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:12,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:12,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:12,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,601 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:12,604 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,654 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:12,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:12,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:12,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_90]. (let ((.cse2 (select v_main_a_90 main_y))) (let ((.cse1 (= (store v_main_a_90 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_90 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 2) (= .cse2 999))))) [2019-05-15 10:28:12,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:12,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:12,761 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:12,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:12,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,810 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:12,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:12,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:12,823 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,823 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_91]. (let ((.cse0 (select v_main_a_91 main_x))) (let ((.cse1 (= (store v_main_a_91 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 2) (= (select v_main_a_91 main_y) 998) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:28:12,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:12,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:12,879 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:12,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:12,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,914 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:12,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:12,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:12,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_92]. (let ((.cse2 (select v_main_a_92 main_y))) (let ((.cse0 (select v_main_a_92 main_x)) (.cse1 (= main_a (store v_main_a_92 main_y (+ .cse2 (- 1)))))) (or (and (= .cse0 3) .cse1 (= .cse2 998)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:28:12,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:13,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:13,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:13,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:13,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,053 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:13,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:13,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:13,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_93]. (let ((.cse1 (select v_main_a_93 main_x))) (let ((.cse0 (= (store v_main_a_93 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_93 main_y) 997) (= .cse1 3))))) [2019-05-15 10:28:13,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:13,110 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:13,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:13,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:13,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:13,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,164 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:13,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:13,165 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:13,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_94]. (let ((.cse2 (select v_main_a_94 main_y))) (let ((.cse0 (select v_main_a_94 main_x)) (.cse1 (= (store v_main_a_94 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 997) (= .cse0 4) .cse1)))) [2019-05-15 10:28:13,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:13,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:13,246 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:13,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:13,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,306 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:13,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:13,306 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:13,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_95]. (let ((.cse1 (select v_main_a_95 main_x))) (let ((.cse0 (= (store v_main_a_95 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 996 (select v_main_a_95 main_y)) (= .cse1 4)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:28:13,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:13,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:13,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:13,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:13,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:13,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,407 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:13,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:13,408 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:13,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_96]. (let ((.cse2 (select v_main_a_96 main_y))) (let ((.cse0 (= (store v_main_a_96 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_96 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 996) .cse0 (= .cse1 5))))) [2019-05-15 10:28:13,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:13,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:13,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:13,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:13,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,568 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:13,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:13,569 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:13,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_97]. (let ((.cse0 (select v_main_a_97 main_x))) (let ((.cse1 (= (store v_main_a_97 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 5) .cse1 (= (select v_main_a_97 main_y) 995)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:28:13,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:13,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:13,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:13,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:13,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,719 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:13,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:13,720 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:13,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,738 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_98]. (let ((.cse1 (select v_main_a_98 main_y))) (let ((.cse2 (= (store v_main_a_98 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_98 main_x))) (or (and (= .cse0 6) (= .cse1 995) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:28:13,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:13,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:13,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:13,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:13,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,877 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:13,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:13,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:13,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_99]. (let ((.cse1 (select v_main_a_99 main_x))) (let ((.cse0 (= main_a (store v_main_a_99 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 6) (= (select v_main_a_99 main_y) 994))))) [2019-05-15 10:28:13,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:13,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:13,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:13,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:13,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:13,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,986 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:13,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:13,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:13,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,997 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_100]. (let ((.cse2 (select v_main_a_100 main_y))) (let ((.cse0 (select v_main_a_100 main_x)) (.cse1 (= (store v_main_a_100 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 994) (= 7 .cse0) .cse1)))) [2019-05-15 10:28:13,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:14,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:14,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:14,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:14,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,110 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:14,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:14,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:14,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_101]. (let ((.cse1 (select v_main_a_101 main_x))) (let ((.cse0 (= main_a (store v_main_a_101 main_x (+ .cse1 1))))) (or (and .cse0 (= 993 (select v_main_a_101 main_y)) (= .cse1 7)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:14,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:28:14,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:14,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:14,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:14,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,198 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:14,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,252 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:14,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:14,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:14,262 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,263 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_102]. (let ((.cse2 (select v_main_a_102 main_y))) (let ((.cse0 (= (store v_main_a_102 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_102 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 993 .cse2) (= 8 .cse1))))) [2019-05-15 10:28:14,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:28:14,311 INFO L273 TraceCheckUtils]: 0: Hoare triple {807#true} a := a[x := 0]; {812#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:14,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {812#(= (select main_a main_x) 0)} a := a[y := 1000]; {816#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:14,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {816#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {820#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:14,313 INFO L273 TraceCheckUtils]: 3: Hoare triple {820#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {824#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:14,314 INFO L273 TraceCheckUtils]: 4: Hoare triple {824#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {828#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:14,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {828#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {832#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:14,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {832#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {836#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:14,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {836#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {840#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:14,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {840#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {844#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:14,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {844#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {848#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:14,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {848#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {852#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:14,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {852#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {856#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:14,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {856#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {860#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:14,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {860#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {864#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:14,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {868#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:14,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {868#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {872#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:14,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {872#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {876#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:14,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {876#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {880#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:14,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {880#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} assume x > y && a[x] == 1000; {808#false} is VALID [2019-05-15 10:28:14,332 INFO L273 TraceCheckUtils]: 19: Hoare triple {808#false} assume !(a[y] <= 0); {808#false} is VALID [2019-05-15 10:28:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:14,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:14,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-15 10:28:14,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-05-15 10:28:14,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:14,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2019-05-15 10:28:14,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:14,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-05-15 10:28:14,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-15 10:28:14,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-05-15 10:28:14,364 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-05-15 10:28:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,319 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:15,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-15 10:28:15,319 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-05-15 10:28:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-05-15 10:28:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-05-15 10:28:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-05-15 10:28:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-05-15 10:28:15,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2019-05-15 10:28:15,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:15,373 INFO L225 Difference]: With dead ends: 23 [2019-05-15 10:28:15,373 INFO L226 Difference]: Without dead ends: 23 [2019-05-15 10:28:15,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-05-15 10:28:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-05-15 10:28:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-05-15 10:28:15,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:15,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:15,376 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:15,376 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,377 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:15,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:15,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:15,378 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:15,378 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,379 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:15,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:15,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:15,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:15,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-05-15 10:28:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-05-15 10:28:15,381 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-05-15 10:28:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:15,382 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-05-15 10:28:15,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-05-15 10:28:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-05-15 10:28:15,382 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:15,383 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-05-15 10:28:15,383 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:15,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:15,383 INFO L82 PathProgramCache]: Analyzing trace with hash 498349676, now seen corresponding path program 9 times [2019-05-15 10:28:15,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:15,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-15 10:28:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:15,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:15,477 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:15,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:15,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_103]. (= (store v_main_a_103 main_x 0) main_a) [2019-05-15 10:28:15,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:15,515 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:15,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,539 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:15,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:15,542 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,542 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_104]. (and (= (select v_main_a_104 main_x) 0) (= main_a (store v_main_a_104 main_y 1000))) [2019-05-15 10:28:15,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:28:15,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:15,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:15,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:15,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,619 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:15,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:15,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:15,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,633 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_105]. (let ((.cse1 (select v_main_a_105 main_x))) (let ((.cse0 (= (select v_main_a_105 main_y) 1000)) (.cse2 (= (store v_main_a_105 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 0 .cse1) .cse2) (and (= main_y main_x) .cse0 .cse2)))) [2019-05-15 10:28:15,633 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:15,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:15,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:15,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:15,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,716 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:15,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:15,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:15,806 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,806 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_106]. (let ((.cse2 (select v_main_a_106 main_y))) (let ((.cse1 (= main_a (store v_main_a_106 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_106 main_x))) (or (and (= .cse0 1) .cse1 (= 1000 .cse2)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:28:15,807 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:15,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:15,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:15,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:15,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,903 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:15,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:15,903 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:15,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_107]. (let ((.cse1 (select v_main_a_107 main_x))) (let ((.cse0 (= (store v_main_a_107 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_107 main_y) 999) .cse0 (= 1 .cse1))))) [2019-05-15 10:28:15,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:15,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:15,969 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:15,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:15,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,020 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:16,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:16,020 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:16,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_108]. (let ((.cse0 (select v_main_a_108 main_y))) (let ((.cse1 (select v_main_a_108 main_x)) (.cse2 (= (store v_main_a_108 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 999 .cse0) (= .cse1 2) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:28:16,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:16,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:16,105 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:16,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:16,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,137 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:16,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:16,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:16,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_109]. (let ((.cse0 (select v_main_a_109 main_x))) (let ((.cse1 (= (store v_main_a_109 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 2) .cse1 (= (select v_main_a_109 main_y) 998)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:28:16,151 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:16,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:16,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:16,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:16,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:16,215 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,238 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:16,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:16,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:16,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_110]. (let ((.cse2 (select v_main_a_110 main_y))) (let ((.cse1 (= main_a (store v_main_a_110 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_110 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 998) (= .cse0 3))))) [2019-05-15 10:28:16,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:16,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:16,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:16,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:16,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,380 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:16,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:16,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:16,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_111]. (let ((.cse0 (select v_main_a_111 main_x))) (let ((.cse1 (= (store v_main_a_111 main_x (+ .cse0 1)) main_a))) (or (and (= 3 .cse0) .cse1 (= 997 (select v_main_a_111 main_y))) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:28:16,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:16,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:16,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:16,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:16,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,497 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:16,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:16,497 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:16,525 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_112]. (let ((.cse1 (select v_main_a_112 main_y))) (let ((.cse0 (= (store v_main_a_112 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_112 main_x))) (or (and .cse0 (= 997 .cse1) (= 4 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:28:16,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:16,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:16,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:16,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:16,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,831 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:16,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:16,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:16,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_113]. (let ((.cse1 (select v_main_a_113 main_x))) (let ((.cse0 (= (store v_main_a_113 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 4 .cse1) (= 996 (select v_main_a_113 main_y)))))) [2019-05-15 10:28:16,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:16,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:16,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:16,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:16,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,018 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:17,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:17,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:17,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_114]. (let ((.cse0 (select v_main_a_114 main_y))) (let ((.cse2 (= main_a (store v_main_a_114 main_y (+ .cse0 (- 1))))) (.cse1 (select v_main_a_114 main_x))) (or (and (= 996 .cse0) (= 5 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:28:17,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:17,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:17,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:17,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:17,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,152 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:17,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:17,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:17,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_115]. (let ((.cse0 (select v_main_a_115 main_x))) (let ((.cse1 (= (store v_main_a_115 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 5) (= (select v_main_a_115 main_y) 995) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:28:17,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:17,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:17,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:17,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:17,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,284 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:17,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:17,284 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:17,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,300 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_116]. (let ((.cse2 (select v_main_a_116 main_y))) (let ((.cse1 (= (store v_main_a_116 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_116 main_x))) (or (and (= .cse0 6) .cse1 (= .cse2 995)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:28:17,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:17,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:17,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:17,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:17,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,395 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:17,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:17,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:17,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_117]. (let ((.cse1 (select v_main_a_117 main_x))) (let ((.cse0 (= main_a (store v_main_a_117 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_117 main_y) 994) (= 6 .cse1))))) [2019-05-15 10:28:17,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:17,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:17,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:17,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:17,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,505 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:17,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:17,506 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:17,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_118]. (let ((.cse2 (select v_main_a_118 main_y))) (let ((.cse0 (= (store v_main_a_118 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_118 main_x))) (or (and .cse0 (= .cse1 7) (= 994 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:28:17,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:17,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:17,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:17,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:17,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,073 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:28:18,073 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:18,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:18,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:18,097 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_119]. (let ((.cse1 (select v_main_a_119 main_x))) (let ((.cse0 (= main_a (store v_main_a_119 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 7) (= (select v_main_a_119 main_y) 993)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:18,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:28:18,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:18,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:18,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:18,354 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,379 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:18,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:18,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:18,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_120]. (let ((.cse0 (select v_main_a_120 main_y))) (let ((.cse2 (select v_main_a_120 main_x)) (.cse1 (= (store v_main_a_120 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 993 .cse0) .cse1 (= 8 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:28:18,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:18,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:18,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:18,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:18,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,538 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:18,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:18,539 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:18,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_121]. (let ((.cse0 (select v_main_a_121 main_x))) (let ((.cse1 (= (store v_main_a_121 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= (select v_main_a_121 main_y) 992) (= 8 .cse0))))) [2019-05-15 10:28:18,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:28:18,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:18,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:18,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:18,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,662 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:18,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:18,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:18,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_122]. (let ((.cse0 (select v_main_a_122 main_y))) (let ((.cse1 (= (store v_main_a_122 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_122 main_x))) (or (and (= 992 .cse0) .cse1 (= 9 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:28:18,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:28:18,720 INFO L273 TraceCheckUtils]: 0: Hoare triple {978#true} a := a[x := 0]; {983#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:18,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {983#(= (select main_a main_x) 0)} a := a[y := 1000]; {987#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:18,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {987#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:18,724 INFO L273 TraceCheckUtils]: 3: Hoare triple {991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {995#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:18,725 INFO L273 TraceCheckUtils]: 4: Hoare triple {995#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:18,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {1003#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:18,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {1003#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:18,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {1007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {1011#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:18,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {1011#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:18,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {1015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {1019#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:18,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {1019#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:18,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {1023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {1027#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:18,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {1027#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:18,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {1031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {1035#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:18,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {1035#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {1039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:18,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {1039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {1043#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:18,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {1043#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {1047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:18,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {1047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {1051#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:18,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {1051#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {1055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:18,761 INFO L273 TraceCheckUtils]: 19: Hoare triple {1055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {1059#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:18,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {1059#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {979#false} is VALID [2019-05-15 10:28:18,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {979#false} assume !(a[y] <= 0); {979#false} is VALID [2019-05-15 10:28:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:18,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:18,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-15 10:28:18,767 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-05-15 10:28:18,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:18,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2019-05-15 10:28:18,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:18,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-05-15 10:28:18,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-15 10:28:18,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-05-15 10:28:18,796 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-05-15 10:28:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,049 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:20,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-15 10:28:20,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-05-15 10:28:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-05-15 10:28:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-05-15 10:28:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-05-15 10:28:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-05-15 10:28:20,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2019-05-15 10:28:20,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:20,084 INFO L225 Difference]: With dead ends: 25 [2019-05-15 10:28:20,084 INFO L226 Difference]: Without dead ends: 25 [2019-05-15 10:28:20,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-05-15 10:28:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-05-15 10:28:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-05-15 10:28:20,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:20,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:20,087 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:20,087 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,088 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:20,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:20,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:20,089 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:20,089 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,090 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:20,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:20,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:20,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:20,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-05-15 10:28:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-05-15 10:28:20,092 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-05-15 10:28:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:20,092 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-05-15 10:28:20,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-05-15 10:28:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-05-15 10:28:20,093 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:20,093 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-05-15 10:28:20,093 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2122451955, now seen corresponding path program 10 times [2019-05-15 10:28:20,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:20,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-15 10:28:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:20,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:20,164 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:20,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:20,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_123]. (= (store v_main_a_123 main_x 0) main_a) [2019-05-15 10:28:20,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:20,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:20,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,250 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:20,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:20,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_124]. (and (= (select v_main_a_124 main_x) 0) (= (store v_main_a_124 main_y 1000) main_a)) [2019-05-15 10:28:20,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:20,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:20,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:20,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:20,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,382 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:20,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:20,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:20,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_125]. (let ((.cse0 (select v_main_a_125 main_x))) (let ((.cse1 (= (select v_main_a_125 main_y) 1000)) (.cse2 (= (store v_main_a_125 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 0) .cse1 .cse2) (and (= main_y main_x) .cse1 .cse2)))) [2019-05-15 10:28:20,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:20,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:20,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:20,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:20,451 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,475 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:20,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:20,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:20,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_126]. (let ((.cse2 (select v_main_a_126 main_y))) (let ((.cse0 (select v_main_a_126 main_x)) (.cse1 (= (store v_main_a_126 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 1) .cse1 (= 1000 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:28:20,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:20,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:20,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:20,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:20,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,601 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:20,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:20,601 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:20,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,612 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_127]. (let ((.cse0 (select v_main_a_127 main_x))) (let ((.cse1 (= (store v_main_a_127 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_127 main_y) 999) .cse1 (= .cse0 1))))) [2019-05-15 10:28:20,612 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:20,698 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:20,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:20,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:20,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,728 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:20,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,767 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:20,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:20,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:20,812 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_128]. (let ((.cse2 (select v_main_a_128 main_y))) (let ((.cse1 (select v_main_a_128 main_x)) (.cse0 (= (store v_main_a_128 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 2) .cse0 (= .cse2 999))))) [2019-05-15 10:28:20,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:20,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:20,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:20,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:20,895 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,919 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:20,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:20,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:20,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_129]. (let ((.cse1 (select v_main_a_129 main_x))) (let ((.cse0 (= (store v_main_a_129 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_129 main_y) 998) (= .cse1 2)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:20,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:20,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:20,990 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:20,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:20,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,022 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:21,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:21,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:21,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_130]. (let ((.cse0 (select v_main_a_130 main_y))) (let ((.cse1 (select v_main_a_130 main_x)) (.cse2 (= (store v_main_a_130 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 998 .cse0) (= 3 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:28:21,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:21,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:21,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:21,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:21,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,230 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:21,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:21,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:21,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_131]. (let ((.cse1 (select v_main_a_131 main_x))) (let ((.cse0 (= main_a (store v_main_a_131 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 3 .cse1) .cse0 (= (select v_main_a_131 main_y) 997))))) [2019-05-15 10:28:21,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:21,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:21,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:21,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:21,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,341 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:21,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:21,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:21,359 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_132]. (let ((.cse1 (select v_main_a_132 main_y))) (let ((.cse0 (select v_main_a_132 main_x)) (.cse2 (= (store v_main_a_132 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 4) (= 997 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:28:21,360 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:21,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:21,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:21,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:21,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,459 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:21,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:21,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:21,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_133]. (let ((.cse0 (select v_main_a_133 main_x))) (let ((.cse1 (= main_a (store v_main_a_133 main_x (+ .cse0 1))))) (or (and (= 4 .cse0) (= (select v_main_a_133 main_y) 996) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:28:21,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:21,514 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:21,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:21,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:21,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:21,539 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,563 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:21,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:21,564 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:21,609 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,609 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_134]. (let ((.cse2 (select v_main_a_134 main_y))) (let ((.cse1 (select v_main_a_134 main_x)) (.cse0 (= main_a (store v_main_a_134 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 5) (= 996 .cse2) .cse0)))) [2019-05-15 10:28:21,609 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:22,083 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-15 10:28:22,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:22,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:22,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:22,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,156 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:22,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:22,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:22,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,174 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_135]. (let ((.cse0 (select v_main_a_135 main_x))) (let ((.cse1 (= main_a (store v_main_a_135 main_x (+ .cse0 1))))) (or (and (= 5 .cse0) (= (select v_main_a_135 main_y) 995) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:28:22,174 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:22,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:22,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:22,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:22,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:22,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,637 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:22,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:22,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:22,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_136]. (let ((.cse2 (select v_main_a_136 main_y))) (let ((.cse0 (= (store v_main_a_136 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_136 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= 995 .cse2) (= .cse1 6))))) [2019-05-15 10:28:22,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:22,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:22,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:22,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:22,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,813 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:22,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:22,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:22,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_137]. (let ((.cse1 (select v_main_a_137 main_x))) (let ((.cse0 (= (store v_main_a_137 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_137 main_y) 994) (= 6 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:28:22,822 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:22,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:22,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:22,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:22,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:22,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,914 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:22,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:22,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:22,922 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,922 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_138]. (let ((.cse2 (select v_main_a_138 main_y))) (let ((.cse1 (= (store v_main_a_138 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_138 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 994 .cse2) .cse1 (= .cse0 7))))) [2019-05-15 10:28:22,922 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:22,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:22,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:22,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,111 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:28:23,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:23,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,136 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:23,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:23,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:23,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_139]. (let ((.cse1 (select v_main_a_139 main_x))) (let ((.cse0 (= (store v_main_a_139 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 7 .cse1) (= (select v_main_a_139 main_y) 993))))) [2019-05-15 10:28:23,151 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:28:23,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:23,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:23,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:23,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:23,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,272 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:23,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:23,273 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:23,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_140]. (let ((.cse2 (select v_main_a_140 main_y))) (let ((.cse0 (= (store v_main_a_140 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_140 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 993) (= .cse1 8))))) [2019-05-15 10:28:23,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:28:23,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:23,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:23,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:23,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,388 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:23,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:23,388 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:23,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_141]. (let ((.cse0 (select v_main_a_141 main_x))) (let ((.cse1 (= (store v_main_a_141 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 8) .cse1 (= 992 (select v_main_a_141 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:28:23,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:28:23,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:23,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:23,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:23,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,531 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:23,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:23,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:23,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,542 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_142]. (let ((.cse2 (select v_main_a_142 main_y))) (let ((.cse0 (select v_main_a_142 main_x)) (.cse1 (= (store v_main_a_142 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 9) .cse1 (= .cse2 992)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:28:23,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:28:23,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:23,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:23,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:23,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,928 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:28:23,929 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:23,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:23,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:23,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_143]. (let ((.cse1 (select v_main_a_143 main_x))) (let ((.cse0 (= (store v_main_a_143 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_143 main_y) 991) .cse0 (= 9 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:28:23,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:28:24,000 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:24,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:24,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:24,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:24,025 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,052 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:24,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:24,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:24,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_144]. (let ((.cse2 (select v_main_a_144 main_y))) (let ((.cse0 (select v_main_a_144 main_x)) (.cse1 (= (store v_main_a_144 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 10 .cse0) (= .cse2 991) .cse1)))) [2019-05-15 10:28:24,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:24,159 INFO L273 TraceCheckUtils]: 0: Hoare triple {1165#true} a := a[x := 0]; {1170#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:24,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#(= (select main_a main_x) 0)} a := a[y := 1000]; {1174#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:24,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {1174#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {1178#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:24,162 INFO L273 TraceCheckUtils]: 3: Hoare triple {1178#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {1182#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:24,168 INFO L273 TraceCheckUtils]: 4: Hoare triple {1182#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1186#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:24,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {1186#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {1190#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:24,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {1190#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1194#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:24,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {1198#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:24,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {1198#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1202#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:24,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {1202#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {1206#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:24,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {1206#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1210#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:24,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {1210#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {1214#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:24,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {1214#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1218#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:24,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {1218#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {1222#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:24,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {1222#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {1226#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:24,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {1230#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:24,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {1230#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {1234#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:24,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {1234#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {1238#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:24,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {1238#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {1242#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:24,185 INFO L273 TraceCheckUtils]: 19: Hoare triple {1242#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {1246#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:24,186 INFO L273 TraceCheckUtils]: 20: Hoare triple {1246#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1250#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:28:24,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {1250#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {1254#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:24,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {1254#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {1166#false} is VALID [2019-05-15 10:28:24,188 INFO L273 TraceCheckUtils]: 23: Hoare triple {1166#false} assume !(a[y] <= 0); {1166#false} is VALID [2019-05-15 10:28:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-15 10:28:24,193 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-05-15 10:28:24,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:24,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2019-05-15 10:28:24,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:24,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-05-15 10:28:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-15 10:28:24,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-05-15 10:28:24,223 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-05-15 10:28:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:25,625 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:25,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-15 10:28:25,625 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-05-15 10:28:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-05-15 10:28:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-05-15 10:28:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-05-15 10:28:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-05-15 10:28:25,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2019-05-15 10:28:25,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:25,704 INFO L225 Difference]: With dead ends: 27 [2019-05-15 10:28:25,704 INFO L226 Difference]: Without dead ends: 27 [2019-05-15 10:28:25,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-05-15 10:28:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-05-15 10:28:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-05-15 10:28:25,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:25,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:25,708 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:25,708 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:25,710 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:25,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:25,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:25,711 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:25,711 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:25,712 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:25,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:25,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:25,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:25,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-05-15 10:28:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-05-15 10:28:25,714 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-05-15 10:28:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:25,714 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-05-15 10:28:25,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-05-15 10:28:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-05-15 10:28:25,715 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:25,715 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-05-15 10:28:25,715 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 432983406, now seen corresponding path program 11 times [2019-05-15 10:28:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:25,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-15 10:28:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:25,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:25,795 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:25,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:25,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_145]. (= (store v_main_a_145 main_x 0) main_a) [2019-05-15 10:28:25,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:25,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:25,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,847 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:25,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:25,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_146]. (and (= (select v_main_a_146 main_x) 0) (= main_a (store v_main_a_146 main_y 1000))) [2019-05-15 10:28:25,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:25,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:25,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:25,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:25,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:25,899 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,922 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:25,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:25,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:25,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_147]. (let ((.cse2 (select v_main_a_147 main_x))) (let ((.cse0 (= (select v_main_a_147 main_y) 1000)) (.cse1 (= (store v_main_a_147 main_x (+ .cse2 1)) main_a))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 (= 0 .cse2) .cse1)))) [2019-05-15 10:28:25,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:25,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:25,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:25,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:26,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,032 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:26,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:26,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:26,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_148]. (let ((.cse2 (select v_main_a_148 main_y))) (let ((.cse0 (= (store v_main_a_148 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_148 main_x))) (or (and .cse0 (= .cse1 1) (= 1000 .cse2)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:28:26,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:26,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:26,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:26,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:26,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,140 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:26,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:26,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:26,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_149]. (let ((.cse0 (select v_main_a_149 main_x))) (let ((.cse1 (= main_a (store v_main_a_149 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 1 .cse0) .cse1 (= (select v_main_a_149 main_y) 999))))) [2019-05-15 10:28:26,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:26,430 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:26,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:26,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:26,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,807 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:28:26,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:26,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,480 WARN L188 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:28:27,481 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:27,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:27,481 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:27,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_150]. (let ((.cse2 (select v_main_a_150 main_y))) (let ((.cse1 (= (store v_main_a_150 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_150 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 999) (= .cse0 2))))) [2019-05-15 10:28:27,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:27,902 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-15 10:28:27,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:27,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:27,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:27,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,974 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:27,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:27,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:27,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_151]. (let ((.cse0 (select v_main_a_151 main_x))) (let ((.cse1 (= (store v_main_a_151 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 2) (= (select v_main_a_151 main_y) 998) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:28:27,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:28,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:28,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:28,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:28,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,087 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:28,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:28,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:28,133 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,133 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_152]. (let ((.cse2 (select v_main_a_152 main_y))) (let ((.cse1 (= (store v_main_a_152 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_152 main_x))) (or (and (= 3 .cse0) .cse1 (= 998 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:28:28,133 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:28,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:28,187 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:28,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:28,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,219 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:28,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:28,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:28,230 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,230 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_153]. (let ((.cse0 (select v_main_a_153 main_x))) (let ((.cse1 (= (store v_main_a_153 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 3) (= 997 (select v_main_a_153 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:28:28,230 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:28,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:28,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:28,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:28,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,331 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:28,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:28,332 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:28,352 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_154]. (let ((.cse2 (select v_main_a_154 main_y))) (let ((.cse1 (select v_main_a_154 main_x)) (.cse0 (= (store v_main_a_154 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= .cse1 4) (= .cse2 997)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:28:28,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:28,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:28,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:28,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:28,415 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,450 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:28,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:28,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:28,459 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,460 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_155]. (let ((.cse0 (select v_main_a_155 main_x))) (let ((.cse1 (= (store v_main_a_155 main_x (+ .cse0 1)) main_a))) (or (and (= 4 .cse0) .cse1 (= 996 (select v_main_a_155 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:28:28,460 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:28,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:28,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:28,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:28,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:28,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,565 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:28,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:28,566 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:28,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_156]. (let ((.cse2 (select v_main_a_156 main_y))) (let ((.cse0 (= (store v_main_a_156 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_156 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 996 .cse2) .cse0 (= 5 .cse1))))) [2019-05-15 10:28:28,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:28,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:28,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:28,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:28,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,732 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:28,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:28,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:28,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_157]. (let ((.cse1 (select v_main_a_157 main_x))) (let ((.cse0 (= (store v_main_a_157 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 5 .cse1) .cse0 (= 995 (select v_main_a_157 main_y)))))) [2019-05-15 10:28:28,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:28,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:28,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:28,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:28,816 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,854 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:28,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:28,854 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:28,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_158]. (let ((.cse1 (select v_main_a_158 main_y))) (let ((.cse0 (select v_main_a_158 main_x)) (.cse2 (= (store v_main_a_158 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 6 .cse0) (= 995 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:28:28,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:28,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:28,978 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:28,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:28,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,013 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:29,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:29,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:29,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_159]. (let ((.cse1 (select v_main_a_159 main_x))) (let ((.cse0 (= (store v_main_a_159 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 6) (= (select v_main_a_159 main_y) 994)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:29,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:29,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:29,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:29,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:29,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:29,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,169 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:29,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:29,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:29,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_160]. (let ((.cse2 (select v_main_a_160 main_y))) (let ((.cse1 (= (store v_main_a_160 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_160 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 994 .cse2) .cse1 (= 7 .cse0))))) [2019-05-15 10:28:29,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:29,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:29,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:29,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,265 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:29,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,291 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:29,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:29,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:29,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_161]. (let ((.cse1 (select v_main_a_161 main_x))) (let ((.cse0 (= (store v_main_a_161 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 7 .cse1) .cse0 (= 993 (select v_main_a_161 main_y)))))) [2019-05-15 10:28:29,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:28:29,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:29,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:29,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:29,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:29,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,395 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:29,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:29,396 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:29,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_162]. (let ((.cse2 (select v_main_a_162 main_y))) (let ((.cse0 (= (store v_main_a_162 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_162 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 8 .cse1) (= 993 .cse2))))) [2019-05-15 10:28:29,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:28:29,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:29,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:29,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:29,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,502 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:29,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:29,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:29,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_163]. (let ((.cse1 (select v_main_a_163 main_x))) (let ((.cse0 (= (store v_main_a_163 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 8 .cse1) (= 992 (select v_main_a_163 main_y)))))) [2019-05-15 10:28:29,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:28:29,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:29,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:29,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:29,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,612 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:29,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:29,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:29,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_164]. (let ((.cse1 (select v_main_a_164 main_y))) (let ((.cse0 (= main_a (store v_main_a_164 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_164 main_x))) (or (and .cse0 (= 992 .cse1) (= 9 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse2))))) [2019-05-15 10:28:29,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:28:29,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:29,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:29,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:29,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,752 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:29,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:29,752 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:29,760 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_165]. (let ((.cse0 (select v_main_a_165 main_x))) (let ((.cse1 (= (store v_main_a_165 main_x (+ .cse0 1)) main_a))) (or (and (= 991 (select v_main_a_165 main_y)) (= 9 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:28:29,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:28:29,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:29,831 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:29,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:29,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,862 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:29,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:29,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:29,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_166]. (let ((.cse0 (select v_main_a_166 main_y))) (let ((.cse1 (= (store v_main_a_166 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_166 main_x))) (or (and (= 991 .cse0) .cse1 (= 10 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:28:29,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:29,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:29,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:29,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:30,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,088 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:30,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:30,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:30,097 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:30,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_167]. (let ((.cse1 (select v_main_a_167 main_x))) (let ((.cse0 (= (store v_main_a_167 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_167 main_y) 990) (= 10 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:28:30,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:28:30,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:30,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:30,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:30,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:30,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:30,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,204 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:30,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:30,204 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:30,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:30,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_168]. (let ((.cse2 (select v_main_a_168 main_y))) (let ((.cse1 (select v_main_a_168 main_x)) (.cse0 (= (store v_main_a_168 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 11) .cse0 (= .cse2 990))))) [2019-05-15 10:28:30,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:28:30,264 INFO L273 TraceCheckUtils]: 0: Hoare triple {1368#true} a := a[x := 0]; {1373#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:30,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {1373#(= (select main_a main_x) 0)} a := a[y := 1000]; {1377#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:30,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {1377#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {1381#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:30,267 INFO L273 TraceCheckUtils]: 3: Hoare triple {1381#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {1385#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:30,269 INFO L273 TraceCheckUtils]: 4: Hoare triple {1385#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1389#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:30,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {1389#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {1393#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:30,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {1393#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1397#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:30,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {1397#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {1401#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:30,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {1401#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1405#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:30,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {1405#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {1409#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:30,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {1409#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1413#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:30,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {1413#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {1417#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:30,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {1417#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1421#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:30,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {1421#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {1425#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:30,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {1425#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {1429#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:30,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {1429#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {1433#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:30,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {1433#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {1437#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:30,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {1437#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {1441#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:30,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {1441#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {1445#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:30,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {1445#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {1449#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:30,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {1449#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1453#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:28:30,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {1453#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {1457#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:30,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {1457#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1461#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:28:30,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {1461#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {1465#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:28:30,294 INFO L273 TraceCheckUtils]: 24: Hoare triple {1465#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} assume x > y && a[x] == 1000; {1369#false} is VALID [2019-05-15 10:28:30,294 INFO L273 TraceCheckUtils]: 25: Hoare triple {1369#false} assume !(a[y] <= 0); {1369#false} is VALID [2019-05-15 10:28:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:30,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:30,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-15 10:28:30,298 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-05-15 10:28:30,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:30,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2019-05-15 10:28:30,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:30,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-05-15 10:28:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-15 10:28:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-05-15 10:28:30,333 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-05-15 10:28:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:31,984 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-15 10:28:31,984 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-05-15 10:28:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-05-15 10:28:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-05-15 10:28:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-05-15 10:28:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-05-15 10:28:31,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2019-05-15 10:28:32,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:32,042 INFO L225 Difference]: With dead ends: 29 [2019-05-15 10:28:32,042 INFO L226 Difference]: Without dead ends: 29 [2019-05-15 10:28:32,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-05-15 10:28:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-05-15 10:28:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-05-15 10:28:32,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:32,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:32,045 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:32,045 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:32,046 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:32,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:32,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:32,046 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:32,047 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:32,048 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:32,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:32,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:32,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:32,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-05-15 10:28:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-05-15 10:28:32,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-05-15 10:28:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:32,050 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-05-15 10:28:32,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-05-15 10:28:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-05-15 10:28:32,050 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:32,051 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-05-15 10:28:32,051 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:32,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:32,051 INFO L82 PathProgramCache]: Analyzing trace with hash -514927985, now seen corresponding path program 12 times [2019-05-15 10:28:32,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:32,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-15 10:28:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:32,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:32,141 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:32,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:32,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_169]. (= (store v_main_a_169 main_x 0) main_a) [2019-05-15 10:28:32,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:32,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:32,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,239 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:32,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:32,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_170]. (and (= (select v_main_a_170 main_x) 0) (= (store v_main_a_170 main_y 1000) main_a)) [2019-05-15 10:28:32,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:32,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:32,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:32,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:32,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,335 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:32,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:32,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:32,344 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_171]. (let ((.cse2 (select v_main_a_171 main_x))) (let ((.cse0 (= (select v_main_a_171 main_y) 1000)) (.cse1 (= (store v_main_a_171 main_x (+ .cse2 1)) main_a))) (or (and .cse0 .cse1 (= 0 .cse2)) (and (= main_y main_x) .cse0 .cse1)))) [2019-05-15 10:28:32,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:32,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:32,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:32,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:32,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,427 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:32,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:32,427 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:32,452 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_172]. (let ((.cse1 (select v_main_a_172 main_y))) (let ((.cse0 (= (store v_main_a_172 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_172 main_x))) (or (and .cse0 (= .cse1 1000) (= 1 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse2))))) [2019-05-15 10:28:32,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:32,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:32,504 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:32,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:32,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,545 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:32,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:32,546 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:32,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_173]. (let ((.cse1 (select v_main_a_173 main_x))) (let ((.cse0 (= (store v_main_a_173 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 1 .cse1) (= (select v_main_a_173 main_y) 999)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:28:32,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:32,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:32,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:32,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:32,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,614 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:32,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,651 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:32,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:32,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:32,680 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,680 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_174]. (let ((.cse2 (select v_main_a_174 main_y))) (let ((.cse1 (= (store v_main_a_174 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_174 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= 999 .cse2) (= .cse0 2))))) [2019-05-15 10:28:32,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:32,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:32,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:32,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:32,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,763 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:32,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:32,763 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:32,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_175]. (let ((.cse0 (select v_main_a_175 main_x))) (let ((.cse1 (= (store v_main_a_175 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 2 .cse0) (= (select v_main_a_175 main_y) 998) .cse1)))) [2019-05-15 10:28:32,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:32,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:32,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:32,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:32,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:32,835 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,857 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:32,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:32,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:32,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_176]. (let ((.cse2 (select v_main_a_176 main_y))) (let ((.cse0 (= (store v_main_a_176 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_176 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 3) (= 998 .cse2))))) [2019-05-15 10:28:32,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:32,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:32,946 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:32,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:32,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,976 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:32,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:32,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:32,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_177]. (let ((.cse1 (select v_main_a_177 main_x))) (let ((.cse0 (= (store v_main_a_177 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 3 .cse1) (= 997 (select v_main_a_177 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:28:32,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:33,052 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:33,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:33,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:33,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:33,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,101 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:33,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:33,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:33,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_178]. (let ((.cse2 (select v_main_a_178 main_y))) (let ((.cse0 (select v_main_a_178 main_x)) (.cse1 (= (store v_main_a_178 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 997 .cse2) (= .cse0 4) .cse1)))) [2019-05-15 10:28:33,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:33,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:33,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:33,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:33,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,249 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:33,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:33,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:33,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,261 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_179]. (let ((.cse1 (select v_main_a_179 main_x))) (let ((.cse0 (= (store v_main_a_179 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_179 main_y) 996) .cse0 (= .cse1 4)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:33,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:33,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:33,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:33,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:33,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:33,325 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,351 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:33,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:33,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:33,394 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_180]. (let ((.cse2 (select v_main_a_180 main_y))) (let ((.cse0 (= main_a (store v_main_a_180 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_180 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 996) .cse0 (= .cse1 5))))) [2019-05-15 10:28:33,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:33,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:33,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:33,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:33,462 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,487 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:33,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:33,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:33,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_181]. (let ((.cse0 (select v_main_a_181 main_x))) (let ((.cse1 (= main_a (store v_main_a_181 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 5 .cse0) (= 995 (select v_main_a_181 main_y)) .cse1)))) [2019-05-15 10:28:33,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:33,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:33,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:33,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:33,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,610 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:33,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:33,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:33,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_182]. (let ((.cse2 (select v_main_a_182 main_y))) (let ((.cse1 (= (store v_main_a_182 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_182 main_x))) (or (and (= .cse0 6) .cse1 (= 995 .cse2)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:28:33,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:33,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:33,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:33,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:33,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,736 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:33,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:33,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:33,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_183]. (let ((.cse1 (select v_main_a_183 main_x))) (let ((.cse0 (= main_a (store v_main_a_183 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 6) .cse0 (= 994 (select v_main_a_183 main_y)))))) [2019-05-15 10:28:33,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:33,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:33,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:33,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:33,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:33,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,961 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:28:33,961 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:33,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:33,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:33,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_184]. (let ((.cse2 (select v_main_a_184 main_y))) (let ((.cse0 (= main_a (store v_main_a_184 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_184 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 994) (= 7 .cse1))))) [2019-05-15 10:28:33,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:34,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:34,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:34,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:34,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,067 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:34,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:34,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:34,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_185]. (let ((.cse1 (select v_main_a_185 main_x))) (let ((.cse0 (= (store v_main_a_185 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_185 main_y) 993) (= 7 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:28:34,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:28:34,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:34,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:34,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:34,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:34,153 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,177 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:34,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:34,177 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:34,187 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_186]. (let ((.cse2 (select v_main_a_186 main_y))) (let ((.cse0 (= (store v_main_a_186 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_186 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= .cse2 993) (= 8 .cse1))))) [2019-05-15 10:28:34,188 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:28:34,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:34,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:34,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:34,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,366 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:34,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:34,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:34,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_187]. (let ((.cse1 (select v_main_a_187 main_x))) (let ((.cse0 (= main_a (store v_main_a_187 main_x (+ .cse1 1))))) (or (and .cse0 (= 992 (select v_main_a_187 main_y)) (= .cse1 8)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:34,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:28:34,429 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:34,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:34,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:34,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:34,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,476 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:34,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:34,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:34,493 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_188]. (let ((.cse2 (select v_main_a_188 main_y))) (let ((.cse0 (select v_main_a_188 main_x)) (.cse1 (= main_a (store v_main_a_188 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 9 .cse0) (= .cse2 992) .cse1)))) [2019-05-15 10:28:34,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:28:34,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:34,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:34,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:34,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,606 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:34,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:34,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:34,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,618 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_189]. (let ((.cse1 (select v_main_a_189 main_x))) (let ((.cse0 (= main_a (store v_main_a_189 main_x (+ .cse1 1))))) (or (and .cse0 (= 991 (select v_main_a_189 main_y)) (= .cse1 9)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:28:34,618 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:28:34,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:34,919 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:28:34,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:34,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:34,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,971 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:34,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:34,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:35,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:35,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_190]. (let ((.cse0 (select v_main_a_190 main_y))) (let ((.cse1 (= (store v_main_a_190 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_190 main_x))) (or (and (= 991 .cse0) .cse1 (= 10 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:28:35,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:35,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:35,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:35,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:35,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:35,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,111 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:35,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:35,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:35,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:35,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_191]. (let ((.cse0 (select v_main_a_191 main_x))) (let ((.cse1 (= (store v_main_a_191 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_191 main_y) 990) (= .cse0 10) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:28:35,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:28:35,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:35,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:35,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:35,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:35,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:35,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,232 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:35,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:35,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:35,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:35,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_192]. (let ((.cse2 (select v_main_a_192 main_y))) (let ((.cse0 (select v_main_a_192 main_x)) (.cse1 (= (store v_main_a_192 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 11) .cse1 (= .cse2 990))))) [2019-05-15 10:28:35,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:28:35,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:35,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:35,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,324 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:35,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:35,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,352 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:35,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:35,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:35,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:35,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_193]. (let ((.cse0 (select v_main_a_193 main_x))) (let ((.cse1 (= (store v_main_a_193 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_193 main_y) 989) (= .cse0 11) .cse1)))) [2019-05-15 10:28:35,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:28:35,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:35,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:35,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:35,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:35,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,486 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:35,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:35,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:35,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:35,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_194]. (let ((.cse0 (select v_main_a_194 main_y))) (let ((.cse1 (= (store v_main_a_194 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_194 main_x))) (or (and (= .cse0 989) .cse1 (= .cse2 12)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:28:35,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:35,588 INFO L273 TraceCheckUtils]: 0: Hoare triple {1587#true} a := a[x := 0]; {1592#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:35,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {1592#(= (select main_a main_x) 0)} a := a[y := 1000]; {1596#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:35,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {1596#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {1600#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:35,591 INFO L273 TraceCheckUtils]: 3: Hoare triple {1600#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {1604#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:35,592 INFO L273 TraceCheckUtils]: 4: Hoare triple {1604#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1608#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:35,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {1608#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {1612#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:35,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {1612#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1616#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:35,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {1616#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {1620#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:35,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {1620#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1624#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:35,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {1624#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {1628#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:35,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {1628#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1632#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:35,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {1632#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {1636#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:35,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {1636#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1640#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:35,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {1640#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {1644#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:35,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {1644#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {1648#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:35,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {1648#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {1652#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:35,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {1652#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {1656#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:35,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {1656#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {1660#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:35,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {1660#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {1664#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:35,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {1664#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {1668#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:35,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {1668#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1672#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:28:35,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {1672#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {1676#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:35,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {1676#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1680#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:28:35,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {1680#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {1684#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:28:35,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {1684#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {1688#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:28:35,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {1688#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {1692#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:35,624 INFO L273 TraceCheckUtils]: 26: Hoare triple {1692#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {1588#false} is VALID [2019-05-15 10:28:35,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {1588#false} assume !(a[y] <= 0); {1588#false} is VALID [2019-05-15 10:28:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:35,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:35,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-15 10:28:35,629 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-05-15 10:28:35,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:35,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2019-05-15 10:28:35,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:35,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-05-15 10:28:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-15 10:28:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-05-15 10:28:35,668 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-05-15 10:28:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:37,603 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-15 10:28:37,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-05-15 10:28:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:28:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-05-15 10:28:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:28:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-05-15 10:28:37,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2019-05-15 10:28:37,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:37,647 INFO L225 Difference]: With dead ends: 31 [2019-05-15 10:28:37,647 INFO L226 Difference]: Without dead ends: 31 [2019-05-15 10:28:37,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-05-15 10:28:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-05-15 10:28:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-05-15 10:28:37,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:37,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:37,650 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:37,650 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:37,651 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:37,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:37,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:37,652 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:37,652 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:37,653 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:37,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:37,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:37,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:37,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-05-15 10:28:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-05-15 10:28:37,655 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-05-15 10:28:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:37,655 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-05-15 10:28:37,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-05-15 10:28:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-05-15 10:28:37,656 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:37,656 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-05-15 10:28:37,657 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash -924707984, now seen corresponding path program 13 times [2019-05-15 10:28:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:37,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-15 10:28:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:37,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:37,755 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:37,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:37,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_195]. (= (store v_main_a_195 main_x 0) main_a) [2019-05-15 10:28:37,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:37,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:37,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,800 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:37,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:37,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_196]. (and (= 0 (select v_main_a_196 main_x)) (= (store v_main_a_196 main_y 1000) main_a)) [2019-05-15 10:28:37,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:37,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:37,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:37,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:37,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:37,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,873 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:37,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:37,874 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:37,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_197]. (let ((.cse2 (select v_main_a_197 main_x))) (let ((.cse0 (= (select v_main_a_197 main_y) 1000)) (.cse1 (= (store v_main_a_197 main_x (+ .cse2 1)) main_a))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 (= .cse2 0) .cse1)))) [2019-05-15 10:28:37,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:37,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:37,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:37,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:37,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,981 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:37,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:37,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_198]. (let ((.cse1 (select v_main_a_198 main_y))) (let ((.cse0 (select v_main_a_198 main_x)) (.cse2 (= (store v_main_a_198 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 1) (= .cse1 1000) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:28:38,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:38,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:38,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:38,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:38,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:38,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,119 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:38,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:38,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,131 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_199]. (let ((.cse0 (select v_main_a_199 main_x))) (let ((.cse1 (= (store v_main_a_199 main_x (+ .cse0 1)) main_a))) (or (and (= 1 .cse0) (= 999 (select v_main_a_199 main_y)) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:28:38,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:38,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:38,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:38,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:38,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:38,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:38,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,222 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:38,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:38,222 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_200]. (let ((.cse2 (select v_main_a_200 main_y))) (let ((.cse1 (= (store v_main_a_200 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_200 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 999) (= .cse0 2))))) [2019-05-15 10:28:38,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:38,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:38,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:38,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,324 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:38,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:38,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,351 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:38,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:38,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,362 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_201]. (let ((.cse1 (select v_main_a_201 main_x))) (let ((.cse0 (= (store v_main_a_201 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_201 main_y) 998) (= .cse1 2))))) [2019-05-15 10:28:38,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:38,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:38,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:38,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:38,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:38,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:38,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,452 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:38,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:38,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_202]. (let ((.cse2 (select v_main_a_202 main_y))) (let ((.cse0 (select v_main_a_202 main_x)) (.cse1 (= (store v_main_a_202 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 3) .cse1 (= .cse2 998))))) [2019-05-15 10:28:38,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:38,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:38,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:38,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:38,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:38,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,586 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:38,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:38,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,599 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_203]. (let ((.cse0 (select v_main_a_203 main_x))) (let ((.cse1 (= (store v_main_a_203 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 3 .cse0) (= 997 (select v_main_a_203 main_y)) .cse1)))) [2019-05-15 10:28:38,599 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:38,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:38,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:38,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:38,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:38,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,700 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:38,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:38,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_204]. (let ((.cse0 (select v_main_a_204 main_y))) (let ((.cse2 (select v_main_a_204 main_x)) (.cse1 (= (store v_main_a_204 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 997) .cse1 (= .cse2 4)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:28:38,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:38,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:38,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:38,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:38,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:38,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,838 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:38,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:38,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_205]. (let ((.cse1 (select v_main_a_205 main_x))) (let ((.cse0 (= (store v_main_a_205 main_x (+ .cse1 1)) main_a))) (or (and (= 996 (select v_main_a_205 main_y)) .cse0 (= 4 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:28:38,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:38,892 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:38,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:38,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:38,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:38,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:38,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:38,947 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:38,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:38,948 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:38,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:38,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_206]. (let ((.cse2 (select v_main_a_206 main_y))) (let ((.cse1 (= (store v_main_a_206 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_206 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 996 .cse2) (= 5 .cse0))))) [2019-05-15 10:28:38,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:39,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,022 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:39,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,053 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_207]. (let ((.cse1 (select v_main_a_207 main_x))) (let ((.cse0 (= (store v_main_a_207 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 5) (= (select v_main_a_207 main_y) 995)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:39,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:39,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:39,132 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,168 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_208]. (let ((.cse1 (select v_main_a_208 main_y))) (let ((.cse0 (= (store v_main_a_208 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_208 main_x))) (or (and .cse0 (= .cse1 995) (= 6 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:28:39,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:39,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:39,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,283 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,296 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_209]. (let ((.cse1 (select v_main_a_209 main_x))) (let ((.cse0 (= (store v_main_a_209 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 6) (= 994 (select v_main_a_209 main_y)))))) [2019-05-15 10:28:39,296 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:39,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:39,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,399 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,400 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_210]. (let ((.cse2 (select v_main_a_210 main_y))) (let ((.cse0 (= main_a (store v_main_a_210 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_210 main_x))) (or (and .cse0 (= 7 .cse1) (= .cse2 994)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:28:39,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:39,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:39,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,509 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,510 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_211]. (let ((.cse1 (select v_main_a_211 main_x))) (let ((.cse0 (= (store v_main_a_211 main_x (+ .cse1 1)) main_a))) (or (and (= 993 (select v_main_a_211 main_y)) .cse0 (= .cse1 7)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:39,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:28:39,570 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:39,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:39,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,618 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_212]. (let ((.cse2 (select v_main_a_212 main_y))) (let ((.cse0 (= (store v_main_a_212 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_212 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 993 .cse2) (= 8 .cse1))))) [2019-05-15 10:28:39,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:28:39,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:39,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,724 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,724 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_213]. (let ((.cse1 (select v_main_a_213 main_x))) (let ((.cse0 (= (store v_main_a_213 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 8) (= 992 (select v_main_a_213 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:39,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:28:39,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:39,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,858 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,869 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,869 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_214]. (let ((.cse2 (select v_main_a_214 main_y))) (let ((.cse0 (select v_main_a_214 main_x)) (.cse1 (= (store v_main_a_214 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 9) .cse1 (= 992 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:28:39,869 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:28:39,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:39,938 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:39,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:39,947 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,984 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:39,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:39,985 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:39,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_215]. (let ((.cse1 (select v_main_a_215 main_x))) (let ((.cse0 (= main_a (store v_main_a_215 main_x (+ .cse1 1))))) (or (and .cse0 (= 9 .cse1) (= 991 (select v_main_a_215 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:28:39,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:28:40,063 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:40,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:40,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:40,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,086 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:40,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,113 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:40,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:40,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:40,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_216]. (let ((.cse2 (select v_main_a_216 main_y))) (let ((.cse0 (= (store v_main_a_216 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_216 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 10) (= 991 .cse2))))) [2019-05-15 10:28:40,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:40,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:40,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:40,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,233 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:40,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,260 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:40,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:40,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:40,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_217]. (let ((.cse1 (select v_main_a_217 main_x))) (let ((.cse0 (= (store v_main_a_217 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_217 main_y) 990) (= 10 .cse1))))) [2019-05-15 10:28:40,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:28:40,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:40,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:40,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:40,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,407 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:40,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:40,408 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:40,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_218]. (let ((.cse1 (select v_main_a_218 main_y))) (let ((.cse0 (select v_main_a_218 main_x)) (.cse2 (= (store v_main_a_218 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 11) (= .cse1 990) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:28:40,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:28:40,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:40,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:40,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:40,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,526 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:40,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:40,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:40,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_219]. (let ((.cse1 (select v_main_a_219 main_x))) (let ((.cse0 (= (store v_main_a_219 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 11 .cse1) .cse0 (= (select v_main_a_219 main_y) 989))))) [2019-05-15 10:28:40,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:28:40,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:40,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:40,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:40,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:40,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,643 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:40,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:40,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:40,698 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_220]. (let ((.cse2 (select v_main_a_220 main_y))) (let ((.cse0 (= (store v_main_a_220 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_220 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 989) (= 12 .cse1))))) [2019-05-15 10:28:40,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:40,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:40,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:40,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:40,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,824 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:40,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:40,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:40,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_221]. (let ((.cse0 (select v_main_a_221 main_x))) (let ((.cse1 (= (store v_main_a_221 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 12 .cse0) (= (select v_main_a_221 main_y) 988))))) [2019-05-15 10:28:40,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:28:40,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:40,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:40,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:40,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,961 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:40,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:40,961 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:41,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:41,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_222]. (let ((.cse1 (select v_main_a_222 main_y))) (let ((.cse0 (select v_main_a_222 main_x)) (.cse2 (= main_a (store v_main_a_222 main_y (+ .cse1 (- 1)))))) (or (and (= .cse0 13) (= 988 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:28:41,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:41,068 INFO L273 TraceCheckUtils]: 0: Hoare triple {1822#true} a := a[x := 0]; {1827#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:41,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {1827#(= (select main_a main_x) 0)} a := a[y := 1000]; {1831#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:41,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {1831#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {1835#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:41,071 INFO L273 TraceCheckUtils]: 3: Hoare triple {1835#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {1839#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,073 INFO L273 TraceCheckUtils]: 4: Hoare triple {1839#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1843#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:41,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {1843#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {1847#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {1847#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1851#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:41,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {1851#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {1855#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {1855#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1859#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:41,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {1859#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {1863#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {1863#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1867#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:41,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {1867#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {1871#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {1871#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1875#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:41,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {1875#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {1879#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:41,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {1879#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {1883#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:41,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {1883#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {1887#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:41,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {1887#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {1891#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:41,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {1891#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {1895#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:41,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {1895#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {1899#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:41,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {1899#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {1903#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {1903#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1907#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:28:41,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {1907#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {1911#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {1911#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1915#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:28:41,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {1915#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {1919#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:28:41,098 INFO L273 TraceCheckUtils]: 24: Hoare triple {1919#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {1923#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:28:41,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {1923#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {1927#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {1927#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {1931#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:28:41,101 INFO L273 TraceCheckUtils]: 27: Hoare triple {1931#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {1935#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:41,102 INFO L273 TraceCheckUtils]: 28: Hoare triple {1935#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {1823#false} is VALID [2019-05-15 10:28:41,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {1823#false} assume !(a[y] <= 0); {1823#false} is VALID [2019-05-15 10:28:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:41,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:41,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-15 10:28:41,108 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-05-15 10:28:41,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:41,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2019-05-15 10:28:41,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:41,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-05-15 10:28:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-15 10:28:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-05-15 10:28:41,149 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-05-15 10:28:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:43,729 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:43,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-15 10:28:43,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-05-15 10:28:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-05-15 10:28:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-05-15 10:28:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-05-15 10:28:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-05-15 10:28:43,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2019-05-15 10:28:43,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:43,791 INFO L225 Difference]: With dead ends: 33 [2019-05-15 10:28:43,792 INFO L226 Difference]: Without dead ends: 33 [2019-05-15 10:28:43,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-05-15 10:28:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-05-15 10:28:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-05-15 10:28:43,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:43,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:43,795 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:43,795 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:43,796 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:43,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:43,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:43,797 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:43,797 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:43,798 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:43,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:43,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:43,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:43,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-05-15 10:28:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-05-15 10:28:43,800 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-05-15 10:28:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:43,800 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-05-15 10:28:43,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-05-15 10:28:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-05-15 10:28:43,801 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:43,801 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-05-15 10:28:43,801 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:43,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:43,801 INFO L82 PathProgramCache]: Analyzing trace with hash 413704209, now seen corresponding path program 14 times [2019-05-15 10:28:43,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:43,852 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-15 10:28:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:43,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:43,893 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:43,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:43,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_223]. (= (store v_main_a_223 main_x 0) main_a) [2019-05-15 10:28:43,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:43,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:43,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,937 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:43,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:43,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_224]. (and (= main_a (store v_main_a_224 main_y 1000)) (= 0 (select v_main_a_224 main_x))) [2019-05-15 10:28:43,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:28:43,963 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:43,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:43,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:43,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:43,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,011 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,011 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_225]. (let ((.cse2 (select v_main_a_225 main_x))) (let ((.cse0 (= (store v_main_a_225 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_225 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= 0 .cse2))))) [2019-05-15 10:28:44,018 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:44,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:44,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:44,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:44,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,095 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_226]. (let ((.cse0 (select v_main_a_226 main_y))) (let ((.cse1 (select v_main_a_226 main_x)) (.cse2 (= (store v_main_a_226 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 1000) (= .cse1 1) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:28:44,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:44,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:44,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:44,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:44,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,264 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_227]. (let ((.cse0 (select v_main_a_227 main_x))) (let ((.cse1 (= (store v_main_a_227 main_x (+ .cse0 1)) main_a))) (or (and (= 1 .cse0) (= (select v_main_a_227 main_y) 999) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:28:44,276 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:44,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:44,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:44,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:44,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:44,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,365 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_228]. (let ((.cse2 (select v_main_a_228 main_y))) (let ((.cse0 (= (store v_main_a_228 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_228 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= 999 .cse2) (= .cse1 2))))) [2019-05-15 10:28:44,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:44,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:44,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:44,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:44,482 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,507 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_229]. (let ((.cse0 (select v_main_a_229 main_x))) (let ((.cse1 (= main_a (store v_main_a_229 main_x (+ .cse0 1))))) (or (and (= .cse0 2) .cse1 (= 998 (select v_main_a_229 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:28:44,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:44,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:44,576 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:44,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:44,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,609 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_230]. (let ((.cse1 (select v_main_a_230 main_y))) (let ((.cse0 (select v_main_a_230 main_x)) (.cse2 (= (store v_main_a_230 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 3) (= .cse1 998) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:28:44,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:44,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:44,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:44,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:44,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,727 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,727 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_231]. (let ((.cse0 (select v_main_a_231 main_x))) (let ((.cse1 (= (store v_main_a_231 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_231 main_y) 997) .cse1 (= .cse0 3))))) [2019-05-15 10:28:44,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:44,781 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:44,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:44,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:44,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:44,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,832 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,865 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_232]. (let ((.cse2 (select v_main_a_232 main_y))) (let ((.cse0 (= (store v_main_a_232 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_232 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 997 .cse2) .cse0 (= 4 .cse1))))) [2019-05-15 10:28:44,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:44,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:44,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:44,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:44,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,974 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:44,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:44,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:44,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_233]. (let ((.cse0 (select v_main_a_233 main_x))) (let ((.cse1 (= (store v_main_a_233 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 4 .cse0) (= 996 (select v_main_a_233 main_y)))))) [2019-05-15 10:28:44,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:45,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:45,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:45,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:45,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,087 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:45,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:45,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:45,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_234]. (let ((.cse0 (select v_main_a_234 main_y))) (let ((.cse1 (= (store v_main_a_234 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_234 main_x))) (or (and (= .cse0 996) .cse1 (= .cse2 5)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:28:45,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:45,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:45,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:45,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:45,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,227 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:45,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:45,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:45,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_235]. (let ((.cse1 (select v_main_a_235 main_x))) (let ((.cse0 (= (store v_main_a_235 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_235 main_y) 995) (= .cse1 5)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:28:45,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:45,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:45,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:45,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:45,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:45,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,343 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:45,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:45,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:45,396 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,396 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_236]. (let ((.cse2 (select v_main_a_236 main_y))) (let ((.cse1 (select v_main_a_236 main_x)) (.cse0 (= (store v_main_a_236 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 995) (= .cse1 6) .cse0)))) [2019-05-15 10:28:45,397 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:45,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:45,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:45,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:45,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,497 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:45,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:45,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:45,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_237]. (let ((.cse0 (select v_main_a_237 main_x))) (let ((.cse1 (= main_a (store v_main_a_237 main_x (+ .cse0 1))))) (or (and (= 6 .cse0) .cse1 (= 994 (select v_main_a_237 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:28:45,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:45,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:45,623 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:45,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:45,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,671 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:45,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:45,672 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:45,690 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,690 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_238]. (let ((.cse0 (select v_main_a_238 main_y))) (let ((.cse1 (select v_main_a_238 main_x)) (.cse2 (= (store v_main_a_238 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 994) (= 7 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:28:45,690 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:45,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:45,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:45,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,762 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:45,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,792 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:45,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:45,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:45,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_239]. (let ((.cse0 (select v_main_a_239 main_x))) (let ((.cse1 (= (store v_main_a_239 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_239 main_y) 993) .cse1 (= .cse0 7))))) [2019-05-15 10:28:45,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:28:45,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:45,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:45,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:45,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:45,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,914 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:45,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:45,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:45,924 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,924 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_240]. (let ((.cse2 (select v_main_a_240 main_y))) (let ((.cse0 (select v_main_a_240 main_x)) (.cse1 (= main_a (store v_main_a_240 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 993 .cse2) (= 8 .cse0) .cse1)))) [2019-05-15 10:28:45,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:28:45,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:45,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:45,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:46,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,026 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:46,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:46,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:46,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_241]. (let ((.cse1 (select v_main_a_241 main_x))) (let ((.cse0 (= main_a (store v_main_a_241 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_241 main_y) 992) .cse0 (= .cse1 8))))) [2019-05-15 10:28:46,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:28:46,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:46,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:46,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:46,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,146 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:46,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:46,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:46,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_242]. (let ((.cse1 (select v_main_a_242 main_y))) (let ((.cse0 (= (store v_main_a_242 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_242 main_x))) (or (and .cse0 (= .cse1 992) (= .cse2 9)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:28:46,159 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:28:46,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:46,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:46,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:46,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,278 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:46,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:46,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:46,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_243]. (let ((.cse0 (select v_main_a_243 main_x))) (let ((.cse1 (= (store v_main_a_243 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 9 .cse0) (= 991 (select v_main_a_243 main_y)) .cse1)))) [2019-05-15 10:28:46,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:28:46,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:46,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:46,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:46,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,392 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:46,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:46,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:46,433 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_244]. (let ((.cse2 (select v_main_a_244 main_y))) (let ((.cse0 (= (store v_main_a_244 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_244 main_x))) (or (and .cse0 (= .cse1 10) (= .cse2 991)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:28:46,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:46,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:46,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:46,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:46,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,531 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:46,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:46,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:46,543 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_245]. (let ((.cse1 (select v_main_a_245 main_x))) (let ((.cse0 (= (store v_main_a_245 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 10) (= (select v_main_a_245 main_y) 990))))) [2019-05-15 10:28:46,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:28:46,599 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:46,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:46,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:46,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:46,623 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,647 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:46,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:46,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:46,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_246]. (let ((.cse2 (select v_main_a_246 main_y))) (let ((.cse0 (= (store v_main_a_246 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_246 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 11 .cse1) (= .cse2 990))))) [2019-05-15 10:28:46,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:28:46,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:46,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:46,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:46,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,896 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:46,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:46,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:46,908 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,908 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_247]. (let ((.cse1 (select v_main_a_247 main_x))) (let ((.cse0 (= main_a (store v_main_a_247 main_x (+ .cse1 1))))) (or (and (= 989 (select v_main_a_247 main_y)) .cse0 (= 11 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:28:46,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:28:46,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:46,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:46,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:46,988 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,011 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:47,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:47,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:47,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:47,055 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_248]. (let ((.cse2 (select v_main_a_248 main_y))) (let ((.cse1 (= main_a (store v_main_a_248 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_248 main_x))) (or (and (= .cse0 12) .cse1 (= 989 .cse2)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:28:47,055 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:47,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:47,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:47,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:47,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:47,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,192 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:47,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:47,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:47,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:47,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_249]. (let ((.cse0 (select v_main_a_249 main_x))) (let ((.cse1 (= (store v_main_a_249 main_x (+ .cse0 1)) main_a))) (or (and (= 988 (select v_main_a_249 main_y)) (= 12 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:28:47,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:28:47,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:47,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:47,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:47,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:47,315 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,374 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:47,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:47,374 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:47,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:47,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_250]. (let ((.cse0 (select v_main_a_250 main_y))) (let ((.cse2 (select v_main_a_250 main_x)) (.cse1 (= main_a (store v_main_a_250 main_y (+ .cse0 (- 1)))))) (or (and (= 988 .cse0) .cse1 (= .cse2 13)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:28:47,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:47,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:47,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:47,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:47,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:47,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,691 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:47,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:47,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:47,701 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:47,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_251]. (let ((.cse1 (select v_main_a_251 main_x))) (let ((.cse0 (= (store v_main_a_251 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 13) (= (select v_main_a_251 main_y) 987)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:47,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:28:47,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:47,774 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:47,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:47,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:47,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,816 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:47,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:47,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:47,829 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:47,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_252]. (let ((.cse0 (select v_main_a_252 main_y))) (let ((.cse1 (select v_main_a_252 main_x)) (.cse2 (= (store v_main_a_252 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 987 .cse0) (= .cse1 14) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:28:47,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:28:47,884 INFO L273 TraceCheckUtils]: 0: Hoare triple {2073#true} a := a[x := 0]; {2078#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:47,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {2078#(= (select main_a main_x) 0)} a := a[y := 1000]; {2082#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:47,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {2082#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {2086#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:47,887 INFO L273 TraceCheckUtils]: 3: Hoare triple {2086#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {2090#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {2090#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2094#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:47,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {2094#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {2098#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {2098#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2102#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:47,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {2102#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {2106#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {2106#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2110#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:47,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {2110#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {2114#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {2114#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2118#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:47,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {2118#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {2122#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {2122#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2126#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:47,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {2126#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {2130#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:47,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {2130#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {2134#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:47,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {2134#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {2138#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:47,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {2138#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {2142#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:47,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {2142#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {2146#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:47,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {2146#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {2150#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:47,913 INFO L273 TraceCheckUtils]: 19: Hoare triple {2150#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {2154#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {2154#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2158#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:28:47,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {2158#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {2162#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {2162#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2166#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:28:47,917 INFO L273 TraceCheckUtils]: 23: Hoare triple {2166#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {2170#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:28:47,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {2170#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {2174#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:28:47,919 INFO L273 TraceCheckUtils]: 25: Hoare triple {2174#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {2178#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,920 INFO L273 TraceCheckUtils]: 26: Hoare triple {2178#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2182#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:28:47,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {2182#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {2186#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:47,923 INFO L273 TraceCheckUtils]: 28: Hoare triple {2186#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2190#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:28:47,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {2190#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {2194#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:28:47,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {2194#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} assume x > y && a[x] == 1000; {2074#false} is VALID [2019-05-15 10:28:47,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {2074#false} assume !(a[y] <= 0); {2074#false} is VALID [2019-05-15 10:28:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:47,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:47,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-15 10:28:47,932 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-05-15 10:28:47,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:47,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2019-05-15 10:28:48,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:48,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-05-15 10:28:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-15 10:28:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-05-15 10:28:48,002 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-05-15 10:28:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:51,259 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:28:51,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-15 10:28:51,259 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-05-15 10:28:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-05-15 10:28:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-05-15 10:28:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-05-15 10:28:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-05-15 10:28:51,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2019-05-15 10:28:51,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:51,313 INFO L225 Difference]: With dead ends: 35 [2019-05-15 10:28:51,313 INFO L226 Difference]: Without dead ends: 35 [2019-05-15 10:28:51,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-05-15 10:28:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-05-15 10:28:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-05-15 10:28:51,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:51,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:51,316 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:51,316 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:51,317 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:28:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:28:51,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:51,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:51,318 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:51,318 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:51,319 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:28:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:28:51,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:51,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:51,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:51,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-05-15 10:28:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-05-15 10:28:51,320 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-05-15 10:28:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:51,320 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-05-15 10:28:51,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-05-15 10:28:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:28:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-05-15 10:28:51,321 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:51,321 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-05-15 10:28:51,322 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:51,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1862367118, now seen corresponding path program 15 times [2019-05-15 10:28:51,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:51,361 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-15 10:28:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:51,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:51,427 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:51,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:51,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_253]. (= main_a (store v_main_a_253 main_x 0)) [2019-05-15 10:28:51,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:51,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:51,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,475 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:51,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:51,478 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_254]. (and (= 0 (select v_main_a_254 main_x)) (= (store v_main_a_254 main_y 1000) main_a)) [2019-05-15 10:28:51,479 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:28:51,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:51,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:51,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:51,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,553 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:51,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:51,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:51,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_255]. (let ((.cse0 (select v_main_a_255 main_x))) (let ((.cse1 (= 1000 (select v_main_a_255 main_y))) (.cse2 (= main_a (store v_main_a_255 main_x (+ .cse0 1))))) (or (and (= .cse0 0) .cse1 .cse2) (and (= main_y main_x) .cse1 .cse2)))) [2019-05-15 10:28:51,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:51,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:51,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:51,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:51,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,650 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:51,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:51,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:51,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_256]. (let ((.cse0 (select v_main_a_256 main_y))) (let ((.cse1 (= (store v_main_a_256 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_256 main_x))) (or (and (= .cse0 1000) .cse1 (= 1 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:28:51,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:51,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:51,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:51,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:51,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,758 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:51,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:51,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:51,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_257]. (let ((.cse0 (select v_main_a_257 main_x))) (let ((.cse1 (= (store v_main_a_257 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 1) .cse1 (= (select v_main_a_257 main_y) 999))))) [2019-05-15 10:28:51,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:51,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:51,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:51,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:51,835 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,872 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:51,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:51,872 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:51,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_258]. (let ((.cse0 (select v_main_a_258 main_y))) (let ((.cse1 (select v_main_a_258 main_x)) (.cse2 (= (store v_main_a_258 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 999 .cse0) (= .cse1 2) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:28:51,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:51,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:51,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:51,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:51,967 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,991 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:51,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:51,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:52,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_259]. (let ((.cse1 (select v_main_a_259 main_x))) (let ((.cse0 (= (store v_main_a_259 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 2 .cse1) .cse0 (= (select v_main_a_259 main_y) 998))))) [2019-05-15 10:28:52,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:52,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:52,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:52,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:52,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,102 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:52,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:52,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:52,133 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,133 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_260]. (let ((.cse1 (select v_main_a_260 main_y))) (let ((.cse0 (select v_main_a_260 main_x)) (.cse2 (= (store v_main_a_260 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 3 .cse0) (= .cse1 998) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:28:52,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:52,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:52,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:52,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:52,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,224 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:52,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:52,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:52,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_261]. (let ((.cse0 (select v_main_a_261 main_x))) (let ((.cse1 (= (store v_main_a_261 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 997 (select v_main_a_261 main_y)) .cse1 (= 3 .cse0))))) [2019-05-15 10:28:52,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:52,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:52,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:52,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:52,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:52,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,324 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:52,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:52,325 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:52,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_262]. (let ((.cse2 (select v_main_a_262 main_y))) (let ((.cse0 (select v_main_a_262 main_x)) (.cse1 (= (store v_main_a_262 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 997) (= 4 .cse0) .cse1)))) [2019-05-15 10:28:52,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:52,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:52,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:52,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:52,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,527 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:52,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:52,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:52,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_263]. (let ((.cse0 (select v_main_a_263 main_x))) (let ((.cse1 (= (store v_main_a_263 main_x (+ .cse0 1)) main_a))) (or (and (= 996 (select v_main_a_263 main_y)) (= 4 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:28:52,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:52,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:52,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:52,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:52,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,600 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:52,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,626 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:52,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:52,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:52,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_264]. (let ((.cse2 (select v_main_a_264 main_y))) (let ((.cse1 (select v_main_a_264 main_x)) (.cse0 (= main_a (store v_main_a_264 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 5) .cse0 (= 996 .cse2))))) [2019-05-15 10:28:52,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:52,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:52,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:52,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:52,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,753 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:52,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:52,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:52,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_265]. (let ((.cse0 (select v_main_a_265 main_x))) (let ((.cse1 (= (store v_main_a_265 main_x (+ .cse0 1)) main_a))) (or (and (= 5 .cse0) (= (select v_main_a_265 main_y) 995) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:28:52,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:28:52,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:52,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:52,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:52,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:52,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,940 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:52,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:52,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:52,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_266]. (let ((.cse2 (select v_main_a_266 main_y))) (let ((.cse0 (= (store v_main_a_266 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_266 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 6) (= 995 .cse2))))) [2019-05-15 10:28:52,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:53,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:53,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:53,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:53,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:53,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,087 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:53,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:53,087 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:53,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:53,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_267]. (let ((.cse1 (select v_main_a_267 main_x))) (let ((.cse0 (= main_a (store v_main_a_267 main_x (+ .cse1 1))))) (or (and .cse0 (= 994 (select v_main_a_267 main_y)) (= .cse1 6)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:53,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:28:53,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:53,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:53,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:53,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:53,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:53,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,202 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:53,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:53,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:53,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:53,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_268]. (let ((.cse2 (select v_main_a_268 main_y))) (let ((.cse1 (= (store v_main_a_268 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_268 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= .cse2 994) (= 7 .cse0))))) [2019-05-15 10:28:53,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:28:53,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:53,274 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:53,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:53,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:53,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,304 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:53,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:53,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:53,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:53,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_269]. (let ((.cse1 (select v_main_a_269 main_x))) (let ((.cse0 (= (store v_main_a_269 main_x (+ .cse1 1)) main_a))) (or (and (= 993 (select v_main_a_269 main_y)) .cse0 (= 7 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:28:53,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:28:53,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:53,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:53,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:53,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:53,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,414 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:53,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:53,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:53,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:53,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_270]. (let ((.cse1 (select v_main_a_270 main_y))) (let ((.cse0 (select v_main_a_270 main_x)) (.cse2 (= (store v_main_a_270 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 8) (= .cse1 993) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:28:53,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:53,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:53,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:53,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,510 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:53,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:53,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,535 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:53,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:53,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:53,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:53,547 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_271]. (let ((.cse0 (select v_main_a_271 main_x))) (let ((.cse1 (= (store v_main_a_271 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_271 main_y) 992) .cse1 (= .cse0 8))))) [2019-05-15 10:28:53,547 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:28:53,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:53,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:53,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:53,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:53,623 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,647 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:53,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:53,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:53,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:53,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_272]. (let ((.cse0 (select v_main_a_272 main_y))) (let ((.cse1 (= main_a (store v_main_a_272 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_272 main_x))) (or (and (= .cse0 992) .cse1 (= .cse2 9)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:28:53,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:28:53,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:53,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:53,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:53,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:53,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,789 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:53,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:53,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:53,799 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:53,799 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_273]. (let ((.cse1 (select v_main_a_273 main_x))) (let ((.cse0 (= (store v_main_a_273 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 991 (select v_main_a_273 main_y)) (= 9 .cse1))))) [2019-05-15 10:28:53,799 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:28:53,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:53,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:53,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:53,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:53,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:53,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:53,912 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:53,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:53,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:53,955 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:53,955 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_274]. (let ((.cse2 (select v_main_a_274 main_y))) (let ((.cse0 (select v_main_a_274 main_x)) (.cse1 (= (store v_main_a_274 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 10) (= .cse2 991) .cse1)))) [2019-05-15 10:28:53,955 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:54,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:54,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:54,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:54,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,075 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:54,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:54,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:54,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_275]. (let ((.cse1 (select v_main_a_275 main_x))) (let ((.cse0 (= (store v_main_a_275 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 10 .cse1) (= (select v_main_a_275 main_y) 990)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:28:54,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:28:54,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:54,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:54,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:54,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:54,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,184 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:54,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:54,185 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:54,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_276]. (let ((.cse2 (select v_main_a_276 main_y))) (let ((.cse0 (= (store v_main_a_276 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_276 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= 990 .cse2) (= .cse1 11))))) [2019-05-15 10:28:54,193 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:28:54,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:54,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:54,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,270 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:54,273 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,296 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:54,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:54,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:54,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,307 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_277]. (let ((.cse0 (select v_main_a_277 main_x))) (let ((.cse1 (= main_a (store v_main_a_277 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= (select v_main_a_277 main_y) 989) (= 11 .cse0))))) [2019-05-15 10:28:54,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:28:54,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:54,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:54,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:54,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,419 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:54,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:54,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:54,462 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,463 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_278]. (let ((.cse2 (select v_main_a_278 main_y))) (let ((.cse1 (= (store v_main_a_278 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_278 main_x))) (or (and (= .cse0 12) .cse1 (= .cse2 989)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:28:54,463 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:54,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:54,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:54,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:54,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,587 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:54,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:54,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:54,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_279]. (let ((.cse0 (select v_main_a_279 main_x))) (let ((.cse1 (= main_a (store v_main_a_279 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 12) (= (select v_main_a_279 main_y) 988))))) [2019-05-15 10:28:54,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:28:54,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:54,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:54,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:54,684 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,720 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:54,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:54,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:54,769 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_280]. (let ((.cse1 (select v_main_a_280 main_y))) (let ((.cse0 (select v_main_a_280 main_x)) (.cse2 (= main_a (store v_main_a_280 main_y (+ .cse1 (- 1)))))) (or (and (= 13 .cse0) (= 988 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:28:54,769 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:54,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:54,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:54,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:54,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,886 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:54,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:54,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:54,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_281]. (let ((.cse1 (select v_main_a_281 main_x))) (let ((.cse0 (= (store v_main_a_281 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_281 main_y) 987) (= .cse1 13)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:54,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:28:54,966 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:54,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:54,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:54,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,995 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:54,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,033 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:55,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:55,034 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:55,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,043 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_282]. (let ((.cse2 (select v_main_a_282 main_y))) (let ((.cse0 (= (store v_main_a_282 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_282 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 987) .cse0 (= .cse1 14))))) [2019-05-15 10:28:55,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:28:55,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:55,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:55,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:55,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,168 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:55,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:55,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:55,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_283]. (let ((.cse0 (select v_main_a_283 main_x))) (let ((.cse1 (= (store v_main_a_283 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 986 (select v_main_a_283 main_y)) (= 14 .cse0) .cse1)))) [2019-05-15 10:28:55,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:28:55,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:55,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:55,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:55,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,295 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:55,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:55,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:55,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,323 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_284]. (let ((.cse2 (select v_main_a_284 main_y))) (let ((.cse0 (= (store v_main_a_284 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_284 main_x))) (or (and .cse0 (= .cse1 15) (= 986 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:28:55,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:55,401 INFO L273 TraceCheckUtils]: 0: Hoare triple {2340#true} a := a[x := 0]; {2345#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:28:55,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {2345#(= (select main_a main_x) 0)} a := a[y := 1000]; {2349#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:28:55,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {2349#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {2353#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:28:55,404 INFO L273 TraceCheckUtils]: 3: Hoare triple {2353#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {2357#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,406 INFO L273 TraceCheckUtils]: 4: Hoare triple {2357#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2361#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:28:55,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {2361#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {2365#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {2365#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2369#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:28:55,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {2369#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {2373#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {2373#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2377#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:28:55,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {2377#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {2381#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {2381#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2385#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:28:55,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {2385#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {2389#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {2389#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2393#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:28:55,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {2393#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {2397#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:28:55,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {2397#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {2401#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:28:55,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {2401#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {2405#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:55,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {2405#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {2409#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:28:55,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {2409#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {2413#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:55,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {2413#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {2417#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:28:55,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {2417#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {2421#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {2421#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2425#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:28:55,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {2425#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {2429#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,428 INFO L273 TraceCheckUtils]: 22: Hoare triple {2429#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2433#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:28:55,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {2433#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {2437#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:28:55,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {2437#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {2441#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:28:55,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {2441#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {2445#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {2445#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2449#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:28:55,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {2449#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {2453#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {2453#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2457#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:28:55,437 INFO L273 TraceCheckUtils]: 29: Hoare triple {2457#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {2461#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:28:55,438 INFO L273 TraceCheckUtils]: 30: Hoare triple {2461#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {2465#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:28:55,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {2465#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {2469#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:28:55,440 INFO L273 TraceCheckUtils]: 32: Hoare triple {2469#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {2341#false} is VALID [2019-05-15 10:28:55,440 INFO L273 TraceCheckUtils]: 33: Hoare triple {2341#false} assume !(a[y] <= 0); {2341#false} is VALID [2019-05-15 10:28:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:55,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-15 10:28:55,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-05-15 10:28:55,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:55,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2019-05-15 10:28:55,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:55,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-05-15 10:28:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-15 10:28:55,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-05-15 10:28:55,495 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-05-15 10:28:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,332 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:28:58,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-15 10:28:58,333 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-05-15 10:28:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-05-15 10:28:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-05-15 10:28:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-05-15 10:28:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-05-15 10:28:58,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2019-05-15 10:28:58,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:58,384 INFO L225 Difference]: With dead ends: 37 [2019-05-15 10:28:58,384 INFO L226 Difference]: Without dead ends: 37 [2019-05-15 10:28:58,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-05-15 10:28:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-05-15 10:28:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-05-15 10:28:58,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:58,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2019-05-15 10:28:58,387 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2019-05-15 10:28:58,387 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2019-05-15 10:28:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,388 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:28:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:28:58,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:58,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:58,389 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2019-05-15 10:28:58,389 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2019-05-15 10:28:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,390 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:28:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:28:58,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:58,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:58,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:58,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-05-15 10:28:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-05-15 10:28:58,392 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-05-15 10:28:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:58,392 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-05-15 10:28:58,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-05-15 10:28:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:28:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-05-15 10:28:58,393 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:58,393 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-05-15 10:28:58,393 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1266408595, now seen corresponding path program 16 times [2019-05-15 10:28:58,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:58,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-15 10:28:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:58,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:58,462 INFO L375 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 6 treesize of output 5 [2019-05-15 10:28:58,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:58,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_285]. (= (store v_main_a_285 main_x 0) main_a) [2019-05-15 10:28:58,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:28:58,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:28:58,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,510 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:28:58,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:28:58,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_286]. (and (= (store v_main_a_286 main_y 1000) main_a) (= 0 (select v_main_a_286 main_x))) [2019-05-15 10:28:58,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:28:58,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:58,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:58,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:58,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,585 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:58,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:58,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:58,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_287]. (let ((.cse2 (select v_main_a_287 main_x))) (let ((.cse0 (= (select v_main_a_287 main_y) 1000)) (.cse1 (= main_a (store v_main_a_287 main_x (+ .cse2 1))))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= main_y main_x) .cse0 .cse1)))) [2019-05-15 10:28:58,596 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:28:58,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:58,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:58,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:58,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,676 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:58,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:58,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:58,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,725 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_288]. (let ((.cse0 (select v_main_a_288 main_y))) (let ((.cse1 (select v_main_a_288 main_x)) (.cse2 (= main_a (store v_main_a_288 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 1000) (= .cse1 1) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:28:58,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:58,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:58,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:58,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:58,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,818 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:58,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:58,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:58,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_289]. (let ((.cse0 (select v_main_a_289 main_x))) (let ((.cse1 (= (store v_main_a_289 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 1) (= 999 (select v_main_a_289 main_y)) .cse1)))) [2019-05-15 10:28:58,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:28:58,863 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:58,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:58,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:58,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,172 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:28:59,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:59,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,208 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:59,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:59,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:59,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,256 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_290]. (let ((.cse2 (select v_main_a_290 main_y))) (let ((.cse0 (= (store v_main_a_290 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_290 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 999 .cse2) (= 2 .cse1))))) [2019-05-15 10:28:59,256 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:59,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:59,316 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:59,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:59,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,349 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:59,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:59,349 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:59,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_291]. (let ((.cse1 (select v_main_a_291 main_x))) (let ((.cse0 (= (store v_main_a_291 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_291 main_y) 998) .cse0 (= 2 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:28:59,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:28:59,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:59,412 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:59,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:59,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,445 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:59,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:59,445 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:59,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_292]. (let ((.cse2 (select v_main_a_292 main_y))) (let ((.cse0 (= (store v_main_a_292 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_292 main_x))) (or (and .cse0 (= .cse1 3) (= 998 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:28:59,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:59,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:59,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:59,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:59,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,567 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:59,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:59,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:59,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_293]. (let ((.cse1 (select v_main_a_293 main_x))) (let ((.cse0 (= (store v_main_a_293 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 3) .cse0 (= 997 (select v_main_a_293 main_y)))))) [2019-05-15 10:28:59,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:28:59,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:28:59,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:59,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:59,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:59,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,665 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:59,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:59,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:59,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,680 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_294]. (let ((.cse2 (select v_main_a_294 main_y))) (let ((.cse0 (= (store v_main_a_294 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_294 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 4) (= 997 .cse2))))) [2019-05-15 10:28:59,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:59,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:59,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:59,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:59,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,778 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:59,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:59,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:59,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_295]. (let ((.cse1 (select v_main_a_295 main_x))) (let ((.cse0 (= (store v_main_a_295 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 4) (= (select v_main_a_295 main_y) 996)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:28:59,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:28:59,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:59,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:59,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:28:59,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,885 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:28:59,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:28:59,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:28:59,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_296]. (let ((.cse2 (select v_main_a_296 main_y))) (let ((.cse0 (select v_main_a_296 main_x)) (.cse1 (= (store v_main_a_296 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 5) .cse1 (= 996 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:28:59,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:28:59,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:28:59,988 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:28:59,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:28:59,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,019 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:00,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:00,020 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:00,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:00,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_297]. (let ((.cse0 (select v_main_a_297 main_x))) (let ((.cse1 (= (store v_main_a_297 main_x (+ .cse0 1)) main_a))) (or (and (= 5 .cse0) .cse1 (= (select v_main_a_297 main_y) 995)) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:29:00,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:29:00,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:00,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:00,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:00,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:00,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,134 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:00,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:00,135 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:00,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:00,143 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_298]. (let ((.cse2 (select v_main_a_298 main_y))) (let ((.cse0 (select v_main_a_298 main_x)) (.cse1 (= (store v_main_a_298 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 6 .cse0) .cse1 (= .cse2 995)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:29:00,143 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:00,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:00,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:00,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:00,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:00,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,238 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:00,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:00,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:00,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:00,249 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_299]. (let ((.cse1 (select v_main_a_299 main_x))) (let ((.cse0 (= (store v_main_a_299 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_299 main_y) 994) (= .cse1 6)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:00,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:29:00,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:00,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:00,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:00,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:00,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,427 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:00,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:00,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:00,437 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:00,437 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_300]. (let ((.cse0 (select v_main_a_300 main_y))) (let ((.cse1 (select v_main_a_300 main_x)) (.cse2 (= (store v_main_a_300 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 994) (= 7 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:29:00,437 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:29:00,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:00,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:00,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:00,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:00,526 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,734 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:29:00,735 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:00,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:00,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:00,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:00,743 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_301]. (let ((.cse1 (select v_main_a_301 main_x))) (let ((.cse0 (= (store v_main_a_301 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_301 main_y) 993) .cse0 (= 7 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:29:00,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:29:00,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:00,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:00,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:00,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:00,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,853 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:00,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:00,853 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:00,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:00,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_302]. (let ((.cse0 (select v_main_a_302 main_y))) (let ((.cse2 (= (store v_main_a_302 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_302 main_x))) (or (and (= .cse0 993) (= 8 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:29:00,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:00,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:00,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:00,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:00,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:00,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:00,988 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:00,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:00,988 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:01,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_303]. (let ((.cse0 (select v_main_a_303 main_x))) (let ((.cse1 (= (store v_main_a_303 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 8) (= 992 (select v_main_a_303 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:01,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:29:01,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:01,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:01,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:01,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,102 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:01,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:01,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:01,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_304]. (let ((.cse0 (select v_main_a_304 main_y))) (let ((.cse1 (select v_main_a_304 main_x)) (.cse2 (= (store v_main_a_304 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 992) (= 9 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:29:01,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:29:01,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:01,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:01,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:01,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,239 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:01,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:01,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:01,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_305]. (let ((.cse0 (select v_main_a_305 main_x))) (let ((.cse1 (= (store v_main_a_305 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 9) (= 991 (select v_main_a_305 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:01,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:29:01,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:01,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:01,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:01,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,352 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:01,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:01,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:01,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_306]. (let ((.cse1 (select v_main_a_306 main_y))) (let ((.cse0 (select v_main_a_306 main_x)) (.cse2 (= (store v_main_a_306 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 10) (= 991 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:29:01,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:01,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:01,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:01,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:01,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,498 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:01,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:01,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:01,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_307]. (let ((.cse1 (select v_main_a_307 main_x))) (let ((.cse0 (= main_a (store v_main_a_307 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 10) (= 990 (select v_main_a_307 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:01,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:29:01,563 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:01,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:01,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:01,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:01,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,613 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:01,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:01,614 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:01,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_308]. (let ((.cse2 (select v_main_a_308 main_y))) (let ((.cse0 (select v_main_a_308 main_x)) (.cse1 (= (store v_main_a_308 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 11 .cse0) (= .cse2 990) .cse1)))) [2019-05-15 10:29:01,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:29:01,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:01,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:01,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:01,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,727 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:01,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:01,727 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:01,737 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_309]. (let ((.cse0 (select v_main_a_309 main_x))) (let ((.cse1 (= (store v_main_a_309 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_309 main_y) 989) (= .cse0 11) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:29:01,738 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:29:01,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:01,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:01,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:01,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:01,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,842 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:01,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:01,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:01,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_310]. (let ((.cse2 (select v_main_a_310 main_y))) (let ((.cse0 (= main_a (store v_main_a_310 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_310 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 989) (= .cse1 12))))) [2019-05-15 10:29:01,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:01,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:01,951 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:01,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:01,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,994 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:01,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:01,995 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:02,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_311]. (let ((.cse1 (select v_main_a_311 main_x))) (let ((.cse0 (= (store v_main_a_311 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_311 main_y) 988) (= .cse1 12)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:02,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:29:02,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:02,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:02,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:02,092 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,128 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:02,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:02,129 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:02,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,175 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_312]. (let ((.cse2 (select v_main_a_312 main_y))) (let ((.cse1 (= (store v_main_a_312 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_312 main_x))) (or (and (= .cse0 13) .cse1 (= .cse2 988)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:29:02,175 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:02,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:02,252 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:02,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:02,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,283 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:02,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:02,284 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:02,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,296 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_313]. (let ((.cse1 (select v_main_a_313 main_x))) (let ((.cse0 (= (store v_main_a_313 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 13 .cse1) (= 987 (select v_main_a_313 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:29:02,296 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:29:02,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:02,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:02,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:02,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,420 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:02,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:02,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:02,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_314]. (let ((.cse2 (select v_main_a_314 main_y))) (let ((.cse0 (= main_a (store v_main_a_314 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_314 main_x))) (or (and .cse0 (= .cse1 14) (= .cse2 987)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:29:02,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:29:02,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:02,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:02,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:02,520 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,546 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:02,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:02,546 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:02,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_315]. (let ((.cse1 (select v_main_a_315 main_x))) (let ((.cse0 (= (store v_main_a_315 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 14 .cse1) (= 986 (select v_main_a_315 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:29:02,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:29:02,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:02,741 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:02,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:02,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,806 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:02,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:02,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:02,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_316]. (let ((.cse0 (select v_main_a_316 main_y))) (let ((.cse2 (select v_main_a_316 main_x)) (.cse1 (= main_a (store v_main_a_316 main_y (+ .cse0 (- 1)))))) (or (and (= 986 .cse0) .cse1 (= 15 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:29:02,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:02,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:02,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:02,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:02,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,002 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:03,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:03,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:03,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_317]. (let ((.cse1 (select v_main_a_317 main_x))) (let ((.cse0 (= main_a (store v_main_a_317 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_317 main_y) 985) (= 15 .cse1))))) [2019-05-15 10:29:03,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:29:03,075 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:03,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:03,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:03,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,097 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:03,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:03,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,134 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:03,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:03,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:03,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_318]. (let ((.cse2 (select v_main_a_318 main_y))) (let ((.cse0 (select v_main_a_318 main_x)) (.cse1 (= (store v_main_a_318 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 16) (= .cse2 985) .cse1)))) [2019-05-15 10:29:03,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:03,268 INFO L273 TraceCheckUtils]: 0: Hoare triple {2623#true} a := a[x := 0]; {2628#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:29:03,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {2628#(= (select main_a main_x) 0)} a := a[y := 1000]; {2632#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:29:03,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {2632#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {2636#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:29:03,272 INFO L273 TraceCheckUtils]: 3: Hoare triple {2636#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {2640#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,274 INFO L273 TraceCheckUtils]: 4: Hoare triple {2640#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2644#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:29:03,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {2644#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {2648#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {2648#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2652#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:29:03,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {2652#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {2656#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {2656#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2660#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:29:03,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {2660#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {2664#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {2664#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2668#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:29:03,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {2668#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {2672#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {2672#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2676#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:29:03,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {2676#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {2680#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:29:03,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {2680#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {2684#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:29:03,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {2684#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {2688#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:03,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {2688#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {2692#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:03,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {2692#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {2696#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:03,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {2696#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {2700#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:03,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {2700#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {2704#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,293 INFO L273 TraceCheckUtils]: 20: Hoare triple {2704#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2708#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:29:03,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {2708#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {2712#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {2712#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2716#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:29:03,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {2716#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {2720#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:29:03,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {2720#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {2724#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:29:03,299 INFO L273 TraceCheckUtils]: 25: Hoare triple {2724#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {2728#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {2728#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2732#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:29:03,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {2736#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {2736#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2740#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:29:03,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {2740#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {2744#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:03,305 INFO L273 TraceCheckUtils]: 30: Hoare triple {2744#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {2748#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:03,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {2748#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {2752#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,307 INFO L273 TraceCheckUtils]: 32: Hoare triple {2752#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2756#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:29:03,308 INFO L273 TraceCheckUtils]: 33: Hoare triple {2756#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {2760#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:03,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {2760#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {2624#false} is VALID [2019-05-15 10:29:03,309 INFO L273 TraceCheckUtils]: 35: Hoare triple {2624#false} assume !(a[y] <= 0); {2624#false} is VALID [2019-05-15 10:29:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:03,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:03,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-15 10:29:03,316 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-05-15 10:29:03,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:03,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2019-05-15 10:29:03,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:03,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-05-15 10:29:03,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-15 10:29:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-05-15 10:29:03,375 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-05-15 10:29:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:06,472 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:06,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-15 10:29:06,473 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-05-15 10:29:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:29:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-05-15 10:29:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:29:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-05-15 10:29:06,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2019-05-15 10:29:06,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:06,525 INFO L225 Difference]: With dead ends: 39 [2019-05-15 10:29:06,525 INFO L226 Difference]: Without dead ends: 39 [2019-05-15 10:29:06,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-05-15 10:29:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-05-15 10:29:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-05-15 10:29:06,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:06,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:06,529 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:06,529 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:06,530 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:06,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:06,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:06,530 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:06,530 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:06,531 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:06,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:06,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:06,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:06,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-05-15 10:29:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-05-15 10:29:06,533 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-05-15 10:29:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:06,533 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-05-15 10:29:06,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-05-15 10:29:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-05-15 10:29:06,534 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:06,534 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-05-15 10:29:06,534 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1542761588, now seen corresponding path program 17 times [2019-05-15 10:29:06,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:06,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-15 10:29:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:06,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:06,691 INFO L375 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 6 treesize of output 5 [2019-05-15 10:29:06,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:06,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_319]. (= (store v_main_a_319 main_x 0) main_a) [2019-05-15 10:29:06,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:29:06,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:29:06,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,924 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:29:06,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:29:06,926 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_320]. (and (= (select v_main_a_320 main_x) 0) (= (store v_main_a_320 main_y 1000) main_a)) [2019-05-15 10:29:06,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:29:06,952 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:06,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:06,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:06,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:06,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,000 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:07,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:07,001 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:07,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_321]. (let ((.cse2 (select v_main_a_321 main_x))) (let ((.cse0 (= (select v_main_a_321 main_y) 1000)) (.cse1 (= (store v_main_a_321 main_x (+ .cse2 1)) main_a))) (or (and (= main_y main_x) .cse0 .cse1) (and (= 0 .cse2) .cse0 .cse1)))) [2019-05-15 10:29:07,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:29:07,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:07,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:07,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:07,067 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,093 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:07,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:07,094 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:07,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_322]. (let ((.cse2 (select v_main_a_322 main_y))) (let ((.cse0 (= main_a (store v_main_a_322 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_322 main_x))) (or (and .cse0 (= 1 .cse1) (= 1000 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse1))))) [2019-05-15 10:29:07,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:07,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:07,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:07,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:07,205 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,242 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:07,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:07,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:07,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_323]. (let ((.cse0 (select v_main_a_323 main_x))) (let ((.cse1 (= (store v_main_a_323 main_x (+ .cse0 1)) main_a))) (or (and (= 1 .cse0) (= 999 (select v_main_a_323 main_y)) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:29:07,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:29:07,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:07,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:07,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:07,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:07,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,351 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:07,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:07,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:07,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_324]. (let ((.cse2 (select v_main_a_324 main_y))) (let ((.cse1 (select v_main_a_324 main_x)) (.cse0 (= (store v_main_a_324 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 999 .cse2) (= 2 .cse1) .cse0)))) [2019-05-15 10:29:07,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:07,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:07,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:07,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:07,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,599 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:29:07,600 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:07,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:07,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:07,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_325]. (let ((.cse0 (select v_main_a_325 main_x))) (let ((.cse1 (= (store v_main_a_325 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_325 main_y) 998) .cse1 (= .cse0 2))))) [2019-05-15 10:29:07,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:29:07,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:07,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:07,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:07,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:07,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,706 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:07,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:07,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:07,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_326]. (let ((.cse2 (select v_main_a_326 main_y))) (let ((.cse1 (select v_main_a_326 main_x)) (.cse0 (= main_a (store v_main_a_326 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 998 .cse2) (= 3 .cse1) .cse0)))) [2019-05-15 10:29:07,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:07,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:07,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:07,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:07,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,877 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:07,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:07,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:07,889 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_327]. (let ((.cse1 (select v_main_a_327 main_x))) (let ((.cse0 (= (store v_main_a_327 main_x (+ .cse1 1)) main_a))) (or (and (= 997 (select v_main_a_327 main_y)) .cse0 (= 3 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:29:07,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:29:07,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:07,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:07,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:07,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,043 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:08,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:08,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:08,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:08,065 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_328]. (let ((.cse2 (select v_main_a_328 main_y))) (let ((.cse1 (select v_main_a_328 main_x)) (.cse0 (= (store v_main_a_328 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 4 .cse1) (= .cse2 997)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:29:08,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:08,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:08,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:08,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:08,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:08,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,221 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:08,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:08,222 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:08,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:08,234 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_329]. (let ((.cse0 (select v_main_a_329 main_x))) (let ((.cse1 (= main_a (store v_main_a_329 main_x (+ .cse0 1))))) (or (and (= 996 (select v_main_a_329 main_y)) (= 4 .cse0) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:29:08,234 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:29:08,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:08,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:08,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:08,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:08,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,321 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:08,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:08,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:08,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:08,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_330]. (let ((.cse1 (select v_main_a_330 main_y))) (let ((.cse0 (= (store v_main_a_330 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_330 main_x))) (or (and .cse0 (= .cse1 996) (= 5 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:29:08,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:08,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:08,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:08,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:08,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:08,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,462 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:08,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:08,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:08,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:08,474 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_331]. (let ((.cse0 (select v_main_a_331 main_x))) (let ((.cse1 (= (store v_main_a_331 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_331 main_y) 995) .cse1 (= .cse0 5))))) [2019-05-15 10:29:08,474 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:29:08,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:08,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:08,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:08,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:08,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:08,581 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,616 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:08,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:08,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:08,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:08,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_332]. (let ((.cse2 (select v_main_a_332 main_y))) (let ((.cse0 (select v_main_a_332 main_x)) (.cse1 (= (store v_main_a_332 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 6) .cse1 (= 995 .cse2))))) [2019-05-15 10:29:08,686 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:08,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:08,749 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:08,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:08,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:08,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,779 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:08,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:08,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:08,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:08,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_333]. (let ((.cse0 (select v_main_a_333 main_x))) (let ((.cse1 (= (store v_main_a_333 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 6) (= 994 (select v_main_a_333 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:08,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:29:08,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:08,855 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:08,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:08,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:08,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,887 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:08,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:08,888 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:08,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:08,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_334]. (let ((.cse2 (select v_main_a_334 main_y))) (let ((.cse0 (= (store v_main_a_334 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_334 main_x))) (or (and .cse0 (= .cse1 7) (= 994 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:29:08,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:29:08,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:08,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:08,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:08,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:08,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:08,994 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:08,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:08,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_335]. (let ((.cse0 (select v_main_a_335 main_x))) (let ((.cse1 (= (store v_main_a_335 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_335 main_y) 993) (= .cse0 7) .cse1)))) [2019-05-15 10:29:09,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:29:09,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:09,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:09,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:09,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,103 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:09,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:09,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_336]. (let ((.cse2 (select v_main_a_336 main_y))) (let ((.cse0 (select v_main_a_336 main_x)) (.cse1 (= (store v_main_a_336 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 8 .cse0) .cse1 (= 993 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:29:09,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:09,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:09,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:09,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:09,215 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,240 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:09,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:09,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_337]. (let ((.cse1 (select v_main_a_337 main_x))) (let ((.cse0 (= (store v_main_a_337 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 8 .cse1) .cse0 (= 992 (select v_main_a_337 main_y)))))) [2019-05-15 10:29:09,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:29:09,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:09,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:09,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:09,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,356 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:09,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:09,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_338]. (let ((.cse2 (select v_main_a_338 main_y))) (let ((.cse0 (select v_main_a_338 main_x)) (.cse1 (= (store v_main_a_338 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 9) .cse1 (= 992 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:29:09,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:29:09,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:09,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:09,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:09,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,476 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:09,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:09,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_339]. (let ((.cse0 (select v_main_a_339 main_x))) (let ((.cse1 (= (store v_main_a_339 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 9) .cse1 (= (select v_main_a_339 main_y) 991))))) [2019-05-15 10:29:09,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:29:09,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:09,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:09,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:09,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:09,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,590 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:09,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:09,591 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,617 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_340]. (let ((.cse2 (select v_main_a_340 main_y))) (let ((.cse1 (= (store v_main_a_340 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_340 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= .cse2 991) (= 10 .cse0))))) [2019-05-15 10:29:09,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:09,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:09,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:09,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:09,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,719 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:09,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:09,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_341]. (let ((.cse1 (select v_main_a_341 main_x))) (let ((.cse0 (= (store v_main_a_341 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_341 main_y) 990) .cse0 (= .cse1 10)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:09,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:29:09,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:09,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:09,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:09,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:09,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,836 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:09,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:09,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,846 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_342]. (let ((.cse2 (select v_main_a_342 main_y))) (let ((.cse0 (select v_main_a_342 main_x)) (.cse1 (= (store v_main_a_342 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 990 .cse2) (= 11 .cse0) .cse1)))) [2019-05-15 10:29:09,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:29:09,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:09,924 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:09,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:09,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,957 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:09,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:09,958 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:09,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_343]. (let ((.cse0 (select v_main_a_343 main_x))) (let ((.cse1 (= (store v_main_a_343 main_x (+ .cse0 1)) main_a))) (or (and (= 11 .cse0) .cse1 (= (select v_main_a_343 main_y) 989)) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:29:09,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:29:10,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:10,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:10,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:10,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:10,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,076 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:10,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:10,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:10,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_344]. (let ((.cse2 (select v_main_a_344 main_y))) (let ((.cse1 (select v_main_a_344 main_x)) (.cse0 (= (store v_main_a_344 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 12 .cse1) (= .cse2 989) .cse0)))) [2019-05-15 10:29:10,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:10,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:10,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:10,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:10,185 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,220 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:10,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:10,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:10,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,232 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_345]. (let ((.cse0 (select v_main_a_345 main_x))) (let ((.cse1 (= (store v_main_a_345 main_x (+ .cse0 1)) main_a))) (or (and (= 12 .cse0) (= (select v_main_a_345 main_y) 988) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:29:10,232 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:29:10,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:10,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:10,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:10,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,366 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:10,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:10,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:10,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_346]. (let ((.cse1 (select v_main_a_346 main_y))) (let ((.cse0 (= main_a (store v_main_a_346 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_346 main_x))) (or (and .cse0 (= .cse1 988) (= 13 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse2))))) [2019-05-15 10:29:10,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:10,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:10,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:10,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:10,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,564 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:10,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:10,565 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:10,585 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,585 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_347]. (let ((.cse1 (select v_main_a_347 main_x))) (let ((.cse0 (= (store v_main_a_347 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_347 main_y) 987) .cse0 (= .cse1 13)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:29:10,585 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:29:10,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:10,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:10,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:10,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:10,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,708 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:10,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:10,708 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:10,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_348]. (let ((.cse2 (select v_main_a_348 main_y))) (let ((.cse0 (select v_main_a_348 main_x)) (.cse1 (= (store v_main_a_348 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 987) (= 14 .cse0) .cse1)))) [2019-05-15 10:29:10,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:29:10,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:10,798 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:10,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:10,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,831 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:10,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:10,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:10,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_349]. (let ((.cse1 (select v_main_a_349 main_x))) (let ((.cse0 (= (store v_main_a_349 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 14) (= 986 (select v_main_a_349 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:10,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:29:10,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:10,924 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:10,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:10,935 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,958 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:10,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:10,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:10,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_350]. (let ((.cse0 (select v_main_a_350 main_y))) (let ((.cse2 (= main_a (store v_main_a_350 main_y (+ .cse0 (- 1))))) (.cse1 (select v_main_a_350 main_x))) (or (and (= 986 .cse0) (= 15 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:29:10,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:11,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:11,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:11,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:11,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,113 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:11,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:11,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:11,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_351]. (let ((.cse0 (select v_main_a_351 main_x))) (let ((.cse1 (= (store v_main_a_351 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 15) .cse1 (= (select v_main_a_351 main_y) 985)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:29:11,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:29:11,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:11,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:11,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:11,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:11,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,248 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:11,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:11,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:11,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_352]. (let ((.cse2 (select v_main_a_352 main_y))) (let ((.cse0 (= (store v_main_a_352 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_352 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 985 .cse2) .cse0 (= .cse1 16))))) [2019-05-15 10:29:11,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:11,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:11,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:11,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:11,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,401 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:11,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:11,402 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:11,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_353]. (let ((.cse0 (select v_main_a_353 main_x))) (let ((.cse1 (= (store v_main_a_353 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 16) (= (select v_main_a_353 main_y) 984) .cse1)))) [2019-05-15 10:29:11,412 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:29:11,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:11,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:11,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:11,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,535 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:11,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:11,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:11,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_354]. (let ((.cse2 (select v_main_a_354 main_y))) (let ((.cse0 (select v_main_a_354 main_x)) (.cse1 (= main_a (store v_main_a_354 main_y (+ .cse2 (- 1)))))) (or (and (= .cse0 17) .cse1 (= .cse2 984)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:29:11,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:29:11,605 INFO L273 TraceCheckUtils]: 0: Hoare triple {2922#true} a := a[x := 0]; {2927#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:29:11,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {2927#(= (select main_a main_x) 0)} a := a[y := 1000]; {2931#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:29:11,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {2931#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {2935#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:29:11,609 INFO L273 TraceCheckUtils]: 3: Hoare triple {2935#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {2939#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,610 INFO L273 TraceCheckUtils]: 4: Hoare triple {2939#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2943#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:29:11,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {2943#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {2947#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,613 INFO L273 TraceCheckUtils]: 6: Hoare triple {2947#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2951#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:29:11,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {2951#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {2955#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {2955#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2959#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:29:11,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {2959#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {2963#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {2963#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2967#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:29:11,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {2967#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {2971#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {2971#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {2975#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:29:11,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {2975#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {2979#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:29:11,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {2979#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {2983#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:29:11,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {2983#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {2987#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:11,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {2987#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {2991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:11,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {2991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {2995#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:11,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {2995#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {2999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:11,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {2999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {3003#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {3003#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:29:11,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {3007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {3011#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {3011#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:29:11,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {3015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {3019#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:29:11,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {3019#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {3023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:29:11,636 INFO L273 TraceCheckUtils]: 25: Hoare triple {3023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {3027#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,638 INFO L273 TraceCheckUtils]: 26: Hoare triple {3027#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:29:11,639 INFO L273 TraceCheckUtils]: 27: Hoare triple {3031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {3035#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {3035#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:29:11,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {3039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {3043#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:11,642 INFO L273 TraceCheckUtils]: 30: Hoare triple {3043#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {3047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:11,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {3047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {3051#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {3051#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:29:11,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {3055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {3059#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:11,647 INFO L273 TraceCheckUtils]: 34: Hoare triple {3059#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3063#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:11,667 INFO L273 TraceCheckUtils]: 35: Hoare triple {3063#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {3067#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:11,677 INFO L273 TraceCheckUtils]: 36: Hoare triple {3067#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} assume x > y && a[x] == 1000; {2923#false} is VALID [2019-05-15 10:29:11,678 INFO L273 TraceCheckUtils]: 37: Hoare triple {2923#false} assume !(a[y] <= 0); {2923#false} is VALID [2019-05-15 10:29:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:11,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:11,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-15 10:29:11,685 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-05-15 10:29:11,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:11,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2019-05-15 10:29:11,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:11,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-05-15 10:29:11,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-15 10:29:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-05-15 10:29:11,739 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-05-15 10:29:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:15,252 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:15,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-15 10:29:15,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-05-15 10:29:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-05-15 10:29:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-05-15 10:29:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-05-15 10:29:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-05-15 10:29:15,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2019-05-15 10:29:15,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:15,306 INFO L225 Difference]: With dead ends: 41 [2019-05-15 10:29:15,306 INFO L226 Difference]: Without dead ends: 41 [2019-05-15 10:29:15,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-05-15 10:29:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-05-15 10:29:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-05-15 10:29:15,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:15,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:15,310 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:15,310 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:15,311 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:15,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:15,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:15,312 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:15,312 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:15,313 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:15,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:15,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:15,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:15,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-05-15 10:29:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-05-15 10:29:15,314 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-05-15 10:29:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:15,315 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-05-15 10:29:15,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-05-15 10:29:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-05-15 10:29:15,315 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:15,315 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-05-15 10:29:15,316 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 830015509, now seen corresponding path program 18 times [2019-05-15 10:29:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:15,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-15 10:29:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:15,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:15,473 INFO L375 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 6 treesize of output 5 [2019-05-15 10:29:15,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:15,519 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_355]. (= (store v_main_a_355 main_x 0) main_a) [2019-05-15 10:29:15,520 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:29:15,938 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-05-15 10:29:15,938 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:29:15,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,998 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:29:15,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:29:16,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_356]. (and (= (store v_main_a_356 main_y 1000) main_a) (= (select v_main_a_356 main_x) 0)) [2019-05-15 10:29:16,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:29:16,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:16,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:16,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,047 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,072 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:16,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:16,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:16,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_357]. (let ((.cse2 (select v_main_a_357 main_x))) (let ((.cse0 (= main_a (store v_main_a_357 main_x (+ .cse2 1)))) (.cse1 (= 1000 (select v_main_a_357 main_y)))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= 0 .cse2))))) [2019-05-15 10:29:16,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:29:16,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:16,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:16,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,162 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:16,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:16,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:16,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_358]. (let ((.cse2 (select v_main_a_358 main_y))) (let ((.cse0 (select v_main_a_358 main_x)) (.cse1 (= (store v_main_a_358 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 1000) (= .cse0 1) .cse1)))) [2019-05-15 10:29:16,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:16,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:16,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,294 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:16,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:16,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:16,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,307 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_359]. (let ((.cse1 (select v_main_a_359 main_x))) (let ((.cse0 (= (store v_main_a_359 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 999 (select v_main_a_359 main_y)) .cse0 (= 1 .cse1))))) [2019-05-15 10:29:16,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:29:16,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:16,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,400 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:16,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:16,401 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:16,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,446 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_360]. (let ((.cse2 (select v_main_a_360 main_y))) (let ((.cse1 (= (store v_main_a_360 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_360 main_x))) (or (and (= 2 .cse0) .cse1 (= 999 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:29:16,446 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:16,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:16,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,527 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:16,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:16,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:16,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_361]. (let ((.cse0 (select v_main_a_361 main_x))) (let ((.cse1 (= main_a (store v_main_a_361 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 2) .cse1 (= (select v_main_a_361 main_y) 998))))) [2019-05-15 10:29:16,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:29:16,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:16,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,624 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:16,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:16,625 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:16,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,665 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_362]. (let ((.cse2 (select v_main_a_362 main_y))) (let ((.cse1 (select v_main_a_362 main_x)) (.cse0 (= (store v_main_a_362 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 3 .cse1) (= 998 .cse2)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:29:16,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:16,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:16,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,725 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,748 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:16,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:16,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:16,760 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_363]. (let ((.cse1 (select v_main_a_363 main_x))) (let ((.cse0 (= (store v_main_a_363 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 3 .cse1) (= 997 (select v_main_a_363 main_y)))))) [2019-05-15 10:29:16,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:29:16,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:16,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,851 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:16,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:16,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:16,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_364]. (let ((.cse2 (select v_main_a_364 main_y))) (let ((.cse0 (select v_main_a_364 main_x)) (.cse1 (= (store v_main_a_364 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 4) .cse1 (= .cse2 997)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:29:16,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:16,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:16,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:16,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:16,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,004 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:17,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:17,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:17,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:17,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_365]. (let ((.cse0 (select v_main_a_365 main_x))) (let ((.cse1 (= main_a (store v_main_a_365 main_x (+ .cse0 1))))) (or (and (= .cse0 4) .cse1 (= (select v_main_a_365 main_y) 996)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:17,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:29:17,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:17,071 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:17,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:17,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:17,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,132 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:17,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:17,132 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:17,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:17,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_366]. (let ((.cse2 (select v_main_a_366 main_y))) (let ((.cse1 (select v_main_a_366 main_x)) (.cse0 (= (store v_main_a_366 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 5 .cse1) (= 996 .cse2)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:29:17,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:17,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:17,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:17,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:17,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:17,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,251 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:17,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:17,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:17,262 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:17,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_367]. (let ((.cse0 (select v_main_a_367 main_x))) (let ((.cse1 (= (store v_main_a_367 main_x (+ .cse0 1)) main_a))) (or (and (= 995 (select v_main_a_367 main_y)) (= 5 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:29:17,262 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:29:17,304 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:17,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:17,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:17,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:17,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:17,328 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,362 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:17,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:17,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:17,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:17,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_368]. (let ((.cse2 (select v_main_a_368 main_y))) (let ((.cse0 (select v_main_a_368 main_x)) (.cse1 (= (store v_main_a_368 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 995 .cse2) (= 6 .cse0) .cse1)))) [2019-05-15 10:29:17,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:17,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:17,467 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:17,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:17,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:17,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,499 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:17,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:17,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:17,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:17,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_369]. (let ((.cse1 (select v_main_a_369 main_x))) (let ((.cse0 (= (store v_main_a_369 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_369 main_y) 994) (= .cse1 6)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:17,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:29:17,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:17,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:17,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:17,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:17,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:17,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,618 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:17,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:17,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:17,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:17,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_370]. (let ((.cse2 (select v_main_a_370 main_y))) (let ((.cse0 (select v_main_a_370 main_x)) (.cse1 (= (store v_main_a_370 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 7) .cse1 (= 994 .cse2))))) [2019-05-15 10:29:17,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:29:17,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:17,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:17,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,757 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:17,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:17,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,783 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:17,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:17,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:17,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:17,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_371]. (let ((.cse1 (select v_main_a_371 main_x))) (let ((.cse0 (= (store v_main_a_371 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 993 (select v_main_a_371 main_y)) (= .cse1 7) .cse0)))) [2019-05-15 10:29:17,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:29:17,842 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:17,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:17,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:17,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:17,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:17,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,891 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:17,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:17,891 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:17,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:17,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_372]. (let ((.cse2 (select v_main_a_372 main_y))) (let ((.cse0 (select v_main_a_372 main_x)) (.cse1 (= main_a (store v_main_a_372 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 993) (= 8 .cse0) .cse1)))) [2019-05-15 10:29:17,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:29:17,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:17,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:17,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:17,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:17,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:17,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,015 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:18,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:18,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:18,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_373]. (let ((.cse0 (select v_main_a_373 main_x))) (let ((.cse1 (= main_a (store v_main_a_373 main_x (+ .cse0 1))))) (or (and (= .cse0 8) (= (select v_main_a_373 main_y) 992) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:18,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:29:18,133 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:18,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:18,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:18,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,170 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:18,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,216 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:18,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:18,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:18,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_374]. (let ((.cse2 (select v_main_a_374 main_y))) (let ((.cse0 (select v_main_a_374 main_x)) (.cse1 (= (store v_main_a_374 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 992) (= 9 .cse0) .cse1)))) [2019-05-15 10:29:18,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:29:18,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:18,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:18,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:18,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,376 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:18,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:18,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:18,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_375]. (let ((.cse0 (select v_main_a_375 main_x))) (let ((.cse1 (= (store v_main_a_375 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_375 main_y) 991) (= 9 .cse0) .cse1)))) [2019-05-15 10:29:18,388 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:29:18,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:18,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:18,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:18,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,497 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:18,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:18,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:18,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_376]. (let ((.cse1 (select v_main_a_376 main_y))) (let ((.cse0 (select v_main_a_376 main_x)) (.cse2 (= (store v_main_a_376 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 10) (= 991 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:29:18,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:18,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:18,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:18,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:18,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,639 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:18,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:18,640 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:18,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_377]. (let ((.cse0 (select v_main_a_377 main_x))) (let ((.cse1 (= (store v_main_a_377 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 990 (select v_main_a_377 main_y)) (= .cse0 10) .cse1)))) [2019-05-15 10:29:18,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:29:18,709 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:18,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:18,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:18,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:18,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,760 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:18,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:18,760 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:18,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_378]. (let ((.cse2 (select v_main_a_378 main_y))) (let ((.cse1 (select v_main_a_378 main_x)) (.cse0 (= (store v_main_a_378 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 990 .cse2) (= .cse1 11) .cse0)))) [2019-05-15 10:29:18,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:29:18,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:18,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:18,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:18,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,879 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:18,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:18,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:18,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_379]. (let ((.cse0 (select v_main_a_379 main_x))) (let ((.cse1 (= (store v_main_a_379 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_379 main_y) 989) (= .cse0 11) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:18,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:29:18,952 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:18,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:18,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:18,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:18,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,004 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:19,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:19,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:19,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_380]. (let ((.cse2 (select v_main_a_380 main_y))) (let ((.cse1 (select v_main_a_380 main_x)) (.cse0 (= (store v_main_a_380 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 12 .cse1) (= .cse2 989) .cse0)))) [2019-05-15 10:29:19,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:19,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:19,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:19,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:19,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,146 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:19,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:19,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:19,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_381]. (let ((.cse0 (select v_main_a_381 main_x))) (let ((.cse1 (= (store v_main_a_381 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 12 .cse0) (= (select v_main_a_381 main_y) 988) .cse1)))) [2019-05-15 10:29:19,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:29:19,226 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:19,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:19,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:19,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:19,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,287 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:19,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:19,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:19,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_382]. (let ((.cse2 (select v_main_a_382 main_y))) (let ((.cse0 (select v_main_a_382 main_x)) (.cse1 (= (store v_main_a_382 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 13 .cse0) .cse1 (= .cse2 988))))) [2019-05-15 10:29:19,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:19,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:19,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:19,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:19,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,473 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:19,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:19,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:19,486 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,486 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_383]. (let ((.cse1 (select v_main_a_383 main_x))) (let ((.cse0 (= (store v_main_a_383 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 13) (= 987 (select v_main_a_383 main_y)))))) [2019-05-15 10:29:19,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:29:19,554 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:19,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:19,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:19,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:19,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,617 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:19,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:19,618 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:19,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_384]. (let ((.cse2 (select v_main_a_384 main_y))) (let ((.cse1 (= (store v_main_a_384 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_384 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 987 .cse2) (= 14 .cse0))))) [2019-05-15 10:29:19,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:29:19,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:19,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:19,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,715 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:19,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,744 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:19,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:19,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:19,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_385]. (let ((.cse1 (select v_main_a_385 main_x))) (let ((.cse0 (= (store v_main_a_385 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 14) (= 986 (select v_main_a_385 main_y)) .cse0)))) [2019-05-15 10:29:19,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:29:19,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:19,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:19,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:19,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:19,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,885 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:19,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:19,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:19,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_386]. (let ((.cse2 (select v_main_a_386 main_y))) (let ((.cse0 (= (store v_main_a_386 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_386 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 15 .cse1) (= 986 .cse2))))) [2019-05-15 10:29:19,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:19,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:19,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:19,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,011 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:20,014 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,037 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:20,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:20,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:20,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_387]. (let ((.cse1 (select v_main_a_387 main_x))) (let ((.cse0 (= (store v_main_a_387 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 985 (select v_main_a_387 main_y)) .cse0 (= 15 .cse1))))) [2019-05-15 10:29:20,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:29:20,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:20,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:20,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:20,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,149 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:20,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,186 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:20,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:20,187 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:20,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_388]. (let ((.cse2 (select v_main_a_388 main_y))) (let ((.cse0 (= (store v_main_a_388 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_388 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 985) (= 16 .cse1))))) [2019-05-15 10:29:20,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:20,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:20,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:20,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:20,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,327 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:20,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:20,327 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:20,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,338 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_389]. (let ((.cse1 (select v_main_a_389 main_x))) (let ((.cse0 (= (store v_main_a_389 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 16 .cse1) (= (select v_main_a_389 main_y) 984)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:29:20,338 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:29:20,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:20,426 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:20,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:20,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,462 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:20,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:20,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:20,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_390]. (let ((.cse0 (select v_main_a_390 main_y))) (let ((.cse2 (select v_main_a_390 main_x)) (.cse1 (= (store v_main_a_390 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 984) .cse1 (= .cse2 17)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:29:20,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:29:20,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:20,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:20,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:20,573 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,596 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:20,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:20,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:20,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_391]. (let ((.cse0 (select v_main_a_391 main_x))) (let ((.cse1 (= (store v_main_a_391 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 17) .cse1 (= (select v_main_a_391 main_y) 983))))) [2019-05-15 10:29:20,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:29:20,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:20,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:20,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:20,702 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,737 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:20,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:20,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:20,815 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_392]. (let ((.cse1 (select v_main_a_392 main_y))) (let ((.cse0 (= (store v_main_a_392 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_392 main_x))) (or (and .cse0 (= .cse1 983) (= .cse2 18)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:29:20,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:20,878 INFO L273 TraceCheckUtils]: 0: Hoare triple {3237#true} a := a[x := 0]; {3242#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:29:20,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {3242#(= (select main_a main_x) 0)} a := a[y := 1000]; {3246#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:29:20,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {3246#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {3250#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:29:20,882 INFO L273 TraceCheckUtils]: 3: Hoare triple {3250#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {3254#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,883 INFO L273 TraceCheckUtils]: 4: Hoare triple {3254#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3258#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:29:20,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {3258#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {3262#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {3262#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3266#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:29:20,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {3266#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {3270#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {3270#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3274#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:29:20,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {3274#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {3278#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {3278#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3282#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:29:20,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {3282#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {3286#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {3286#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3290#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:29:20,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {3290#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {3294#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:29:20,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {3294#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {3298#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:29:20,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {3298#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {3302#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:20,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {3302#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {3306#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:20,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {3306#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {3310#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:20,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {3310#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {3314#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:20,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {3314#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {3318#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {3318#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3322#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:29:20,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {3322#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {3326#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {3326#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3330#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:29:20,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {3330#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {3334#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:29:20,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {3334#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {3338#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:29:20,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {3338#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {3342#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {3342#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3346#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:29:20,914 INFO L273 TraceCheckUtils]: 27: Hoare triple {3346#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {3350#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {3350#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3354#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:29:20,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {3354#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {3358#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:20,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {3358#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {3362#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:20,919 INFO L273 TraceCheckUtils]: 31: Hoare triple {3362#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {3366#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {3366#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3370#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:29:20,921 INFO L273 TraceCheckUtils]: 33: Hoare triple {3370#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {3374#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {3374#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3378#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:20,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {3378#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {3382#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:20,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {3382#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {3386#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:29:20,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {3386#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {3390#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:20,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {3390#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {3238#false} is VALID [2019-05-15 10:29:20,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {3238#false} assume !(a[y] <= 0); {3238#false} is VALID [2019-05-15 10:29:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:20,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:20,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-15 10:29:20,934 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-05-15 10:29:20,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:20,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2019-05-15 10:29:20,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:20,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-05-15 10:29:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-15 10:29:20,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-05-15 10:29:20,990 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-05-15 10:29:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:25,026 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:25,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-15 10:29:25,026 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-05-15 10:29:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-05-15 10:29:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-05-15 10:29:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-05-15 10:29:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-05-15 10:29:25,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2019-05-15 10:29:25,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:25,098 INFO L225 Difference]: With dead ends: 43 [2019-05-15 10:29:25,098 INFO L226 Difference]: Without dead ends: 43 [2019-05-15 10:29:25,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-05-15 10:29:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-05-15 10:29:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-05-15 10:29:25,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:25,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:25,101 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:25,101 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:25,102 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:25,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:25,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:25,102 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:25,103 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:25,103 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:25,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:25,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:25,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:25,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-05-15 10:29:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-05-15 10:29:25,105 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-05-15 10:29:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:25,105 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-05-15 10:29:25,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-05-15 10:29:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-05-15 10:29:25,106 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:25,106 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-05-15 10:29:25,106 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:25,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1219166346, now seen corresponding path program 19 times [2019-05-15 10:29:25,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:25,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-15 10:29:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:25,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:25,235 INFO L375 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 6 treesize of output 5 [2019-05-15 10:29:25,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:25,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_393]. (= main_a (store v_main_a_393 main_x 0)) [2019-05-15 10:29:25,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:29:25,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:29:25,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,278 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:29:25,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:29:25,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_394]. (and (= (store v_main_a_394 main_y 1000) main_a) (= 0 (select v_main_a_394 main_x))) [2019-05-15 10:29:25,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:29:25,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:25,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:25,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:25,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:25,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,354 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:25,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:25,355 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:25,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_395]. (let ((.cse2 (select v_main_a_395 main_x))) (let ((.cse0 (= main_a (store v_main_a_395 main_x (+ .cse2 1)))) (.cse1 (= (select v_main_a_395 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:29:25,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:29:25,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:25,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:25,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:25,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,447 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:25,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:25,447 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:25,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_396]. (let ((.cse1 (select v_main_a_396 main_y))) (let ((.cse0 (= (store v_main_a_396 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_396 main_x))) (or (and .cse0 (= 1000 .cse1) (= .cse2 1)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:29:25,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:25,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:25,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:25,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:25,531 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,566 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:25,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:25,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:25,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,580 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_397]. (let ((.cse0 (select v_main_a_397 main_x))) (let ((.cse1 (= main_a (store v_main_a_397 main_x (+ .cse0 1))))) (or (and (= .cse0 1) .cse1 (= (select v_main_a_397 main_y) 999)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:29:25,580 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:29:25,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:25,630 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:25,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:25,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,672 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:25,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:25,673 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:25,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_398]. (let ((.cse0 (select v_main_a_398 main_y))) (let ((.cse1 (select v_main_a_398 main_x)) (.cse2 (= (store v_main_a_398 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 999) (= .cse1 2) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:29:25,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:25,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:25,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:25,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:25,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,773 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:25,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:25,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:25,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_399]. (let ((.cse1 (select v_main_a_399 main_x))) (let ((.cse0 (= (store v_main_a_399 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 2) .cse0 (= 998 (select v_main_a_399 main_y)))))) [2019-05-15 10:29:25,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:29:25,823 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:25,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:25,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:25,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:25,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,879 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:25,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:25,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:25,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_400]. (let ((.cse2 (select v_main_a_400 main_y))) (let ((.cse0 (= main_a (store v_main_a_400 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_400 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 3 .cse1) (= 998 .cse2))))) [2019-05-15 10:29:25,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:25,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:25,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:25,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:25,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,982 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:25,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:25,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:25,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_401]. (let ((.cse0 (select v_main_a_401 main_x))) (let ((.cse1 (= (store v_main_a_401 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 3 .cse0) (= 997 (select v_main_a_401 main_y)) .cse1)))) [2019-05-15 10:29:25,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:29:26,034 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:26,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:26,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:26,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:26,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:26,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,081 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:26,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:26,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:26,116 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:26,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_402]. (let ((.cse2 (select v_main_a_402 main_y))) (let ((.cse1 (= main_a (store v_main_a_402 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_402 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 4 .cse0) (= 997 .cse2))))) [2019-05-15 10:29:26,117 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:26,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:26,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:26,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:26,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:26,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,215 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:26,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:26,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:26,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:26,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_403]. (let ((.cse0 (select v_main_a_403 main_x))) (let ((.cse1 (= (store v_main_a_403 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 996 (select v_main_a_403 main_y)) (= 4 .cse0) .cse1)))) [2019-05-15 10:29:26,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:29:26,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:26,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:26,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:26,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:26,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:26,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,324 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:26,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:26,325 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:26,388 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:26,388 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_404]. (let ((.cse2 (select v_main_a_404 main_y))) (let ((.cse0 (select v_main_a_404 main_x)) (.cse1 (= (store v_main_a_404 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 5 .cse0) (= 996 .cse2) .cse1)))) [2019-05-15 10:29:26,388 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:26,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:26,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:26,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:26,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:26,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,477 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:26,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:26,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:26,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:26,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_405]. (let ((.cse0 (select v_main_a_405 main_x))) (let ((.cse1 (= (store v_main_a_405 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 5) .cse1 (= (select v_main_a_405 main_y) 995)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:29:26,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:29:26,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:26,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:26,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:26,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:26,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,591 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:26,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:26,591 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:26,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:26,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_406]. (let ((.cse1 (select v_main_a_406 main_y))) (let ((.cse0 (select v_main_a_406 main_x)) (.cse2 (= (store v_main_a_406 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 6 .cse0) (= 995 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:29:26,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:26,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:26,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:26,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,712 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:26,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:26,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,737 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:26,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:26,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:26,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:26,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_407]. (let ((.cse0 (select v_main_a_407 main_x))) (let ((.cse1 (= (store v_main_a_407 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 994 (select v_main_a_407 main_y)) (= .cse0 6) .cse1)))) [2019-05-15 10:29:26,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:29:26,792 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:26,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:26,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:26,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:26,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:26,816 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,840 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:26,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:26,841 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:26,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:26,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_408]. (let ((.cse2 (select v_main_a_408 main_y))) (let ((.cse1 (= (store v_main_a_408 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_408 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 7 .cse0) (= .cse2 994))))) [2019-05-15 10:29:26,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:29:26,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:26,912 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:26,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:26,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:26,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:26,943 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:26,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:26,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:26,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:26,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_409]. (let ((.cse0 (select v_main_a_409 main_x))) (let ((.cse1 (= (store v_main_a_409 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 7) .cse1 (= (select v_main_a_409 main_y) 993)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:26,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:29:27,002 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:27,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:27,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,050 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:27,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:27,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:27,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_410]. (let ((.cse2 (select v_main_a_410 main_y))) (let ((.cse1 (= (store v_main_a_410 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_410 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 993) .cse1 (= .cse0 8))))) [2019-05-15 10:29:27,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:29:27,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,126 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:27,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,158 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:27,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:27,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:27,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_411]. (let ((.cse0 (select v_main_a_411 main_x))) (let ((.cse1 (= (store v_main_a_411 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 8) .cse1 (= 992 (select v_main_a_411 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:27,170 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:29:27,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:27,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:27,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,266 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:27,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:27,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:27,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_412]. (let ((.cse2 (select v_main_a_412 main_y))) (let ((.cse0 (select v_main_a_412 main_x)) (.cse1 (= main_a (store v_main_a_412 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 9) (= 992 .cse2) .cse1)))) [2019-05-15 10:29:27,279 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:29:27,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:27,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,386 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:27,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:27,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:27,397 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,397 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_413]. (let ((.cse0 (select v_main_a_413 main_x))) (let ((.cse1 (= (store v_main_a_413 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 9 .cse0) .cse1 (= (select v_main_a_413 main_y) 991))))) [2019-05-15 10:29:27,397 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:29:27,449 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:27,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:27,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,496 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:27,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:27,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:27,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_414]. (let ((.cse2 (select v_main_a_414 main_y))) (let ((.cse0 (select v_main_a_414 main_x)) (.cse1 (= main_a (store v_main_a_414 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 991 .cse2) (= .cse0 10) .cse1)))) [2019-05-15 10:29:27,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:27,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:27,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,657 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:27,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:27,657 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:27,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,667 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_415]. (let ((.cse1 (select v_main_a_415 main_x))) (let ((.cse0 (= main_a (store v_main_a_415 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_415 main_y) 990) (= 10 .cse1))))) [2019-05-15 10:29:27,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:29:27,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:27,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:27,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,773 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:27,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:27,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:27,784 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_416]. (let ((.cse2 (select v_main_a_416 main_y))) (let ((.cse0 (select v_main_a_416 main_x)) (.cse1 (= (store v_main_a_416 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 990 .cse2) (= .cse0 11) .cse1)))) [2019-05-15 10:29:27,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:29:27,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:27,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,886 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:27,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:27,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:27,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_417]. (let ((.cse1 (select v_main_a_417 main_x))) (let ((.cse0 (= (store v_main_a_417 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_417 main_y) 989) .cse0 (= 11 .cse1))))) [2019-05-15 10:29:27,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:29:27,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:27,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:27,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:27,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:27,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,015 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:28,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:28,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:28,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_418]. (let ((.cse2 (select v_main_a_418 main_y))) (let ((.cse1 (select v_main_a_418 main_x)) (.cse0 (= (store v_main_a_418 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 989) (= .cse1 12) .cse0)))) [2019-05-15 10:29:28,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:28,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:28,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:28,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:28,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,200 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:28,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:28,200 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:28,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_419]. (let ((.cse1 (select v_main_a_419 main_x))) (let ((.cse0 (= main_a (store v_main_a_419 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_419 main_y) 988) .cse0 (= .cse1 12)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:28,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:29:28,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:28,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:28,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:28,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:28,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,417 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:28,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:28,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:28,452 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,452 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_420]. (let ((.cse2 (select v_main_a_420 main_y))) (let ((.cse0 (select v_main_a_420 main_x)) (.cse1 (= main_a (store v_main_a_420 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 988) (= 13 .cse0) .cse1)))) [2019-05-15 10:29:28,452 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:28,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:28,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:28,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:28,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,647 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:28,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:28,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:28,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,659 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_421]. (let ((.cse0 (select v_main_a_421 main_x))) (let ((.cse1 (= (store v_main_a_421 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_421 main_y) 987) .cse1 (= .cse0 13))))) [2019-05-15 10:29:28,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:29:28,724 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:28,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:28,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:28,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:28,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,877 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:28,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:28,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:28,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_422]. (let ((.cse2 (select v_main_a_422 main_y))) (let ((.cse0 (select v_main_a_422 main_x)) (.cse1 (= (store v_main_a_422 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 987) (= 14 .cse0) .cse1)))) [2019-05-15 10:29:28,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:29:28,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:28,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:28,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:28,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,003 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:29,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:29,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:29,015 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_423]. (let ((.cse0 (select v_main_a_423 main_x))) (let ((.cse1 (= (store v_main_a_423 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 14) (= 986 (select v_main_a_423 main_y)) .cse1)))) [2019-05-15 10:29:29,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:29:29,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:29,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:29,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:29,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:29,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,134 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:29,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:29,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:29,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_424]. (let ((.cse2 (select v_main_a_424 main_y))) (let ((.cse1 (select v_main_a_424 main_x)) (.cse0 (= (store v_main_a_424 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 15 .cse1) .cse0 (= .cse2 986))))) [2019-05-15 10:29:29,188 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:29,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:29,273 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:29,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:29,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,336 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:29,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:29,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:29,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_425]. (let ((.cse0 (select v_main_a_425 main_x))) (let ((.cse1 (= (store v_main_a_425 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 15) (= 985 (select v_main_a_425 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:29,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:29:29,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:29,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:29,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:29,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,483 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:29,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:29,484 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:29,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_426]. (let ((.cse2 (select v_main_a_426 main_y))) (let ((.cse0 (select v_main_a_426 main_x)) (.cse1 (= (store v_main_a_426 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 16 .cse0) .cse1 (= 985 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:29:29,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:29,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:29,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:29,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,619 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:29,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,645 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:29,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:29,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:29,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_427]. (let ((.cse0 (select v_main_a_427 main_x))) (let ((.cse1 (= (store v_main_a_427 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 984 (select v_main_a_427 main_y)) (= .cse0 16) .cse1)))) [2019-05-15 10:29:29,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:29:29,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:29,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:29,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:29,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,773 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:29,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:29,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:29,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_428]. (let ((.cse2 (select v_main_a_428 main_y))) (let ((.cse1 (select v_main_a_428 main_x)) (.cse0 (= (store v_main_a_428 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 17 .cse1) (= .cse2 984)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:29:29,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:29:29,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:29,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:29,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:29,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,911 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:29,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:29,912 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:29,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_429]. (let ((.cse0 (select v_main_a_429 main_x))) (let ((.cse1 (= main_a (store v_main_a_429 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_429 main_y) 983) .cse1 (= 17 .cse0))))) [2019-05-15 10:29:29,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:29:29,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:30,008 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:30,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:30,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,051 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:30,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:30,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:30,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,115 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_430]. (let ((.cse2 (select v_main_a_430 main_y))) (let ((.cse0 (select v_main_a_430 main_x)) (.cse1 (= (store v_main_a_430 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 18) .cse1 (= .cse2 983)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:29:30,115 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:30,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:30,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:30,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:30,208 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,232 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:30,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:30,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:30,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_431]. (let ((.cse0 (select v_main_a_431 main_x))) (let ((.cse1 (= (store v_main_a_431 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_431 main_y) 982) (= .cse0 18) .cse1)))) [2019-05-15 10:29:30,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:29:30,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:30,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:30,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:30,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,335 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:30,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,361 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:30,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:30,362 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:30,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_432]. (let ((.cse2 (select v_main_a_432 main_y))) (let ((.cse0 (select v_main_a_432 main_x)) (.cse1 (= (store v_main_a_432 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 19 .cse0) (= 982 .cse2) .cse1)))) [2019-05-15 10:29:30,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:29:30,436 INFO L273 TraceCheckUtils]: 0: Hoare triple {3568#true} a := a[x := 0]; {3573#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:29:30,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {3573#(= (select main_a main_x) 0)} a := a[y := 1000]; {3577#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:29:30,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {3577#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {3581#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:29:30,440 INFO L273 TraceCheckUtils]: 3: Hoare triple {3581#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {3585#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,441 INFO L273 TraceCheckUtils]: 4: Hoare triple {3585#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3589#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:29:30,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {3589#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {3593#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {3593#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3597#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:29:30,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {3597#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {3601#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {3601#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3605#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:29:30,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {3605#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {3609#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {3609#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3613#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:29:30,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {3617#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {3617#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3621#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:29:30,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {3621#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {3625#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:29:30,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {3625#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {3629#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:29:30,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {3629#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {3633#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:30,481 INFO L273 TraceCheckUtils]: 16: Hoare triple {3633#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {3637#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:30,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {3637#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {3641#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:30,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {3641#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {3645#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:30,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {3645#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {3649#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {3649#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3653#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:29:30,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {3653#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {3657#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {3657#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3661#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:29:30,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {3661#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {3665#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:29:30,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {3665#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {3669#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:29:30,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {3669#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {3673#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {3673#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3677#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:29:30,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {3677#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {3681#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,495 INFO L273 TraceCheckUtils]: 28: Hoare triple {3681#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3685#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:29:30,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {3685#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {3689#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:30,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {3689#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {3693#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:30,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {3693#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {3697#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {3697#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3701#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:29:30,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {3701#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {3705#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {3705#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3709#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:30,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {3709#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {3713#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:30,505 INFO L273 TraceCheckUtils]: 36: Hoare triple {3713#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {3717#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:29:30,506 INFO L273 TraceCheckUtils]: 37: Hoare triple {3717#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {3721#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:30,507 INFO L273 TraceCheckUtils]: 38: Hoare triple {3721#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3725#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:29:30,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {3725#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {3729#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:29:30,509 INFO L273 TraceCheckUtils]: 40: Hoare triple {3729#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} assume x > y && a[x] == 1000; {3569#false} is VALID [2019-05-15 10:29:30,509 INFO L273 TraceCheckUtils]: 41: Hoare triple {3569#false} assume !(a[y] <= 0); {3569#false} is VALID [2019-05-15 10:29:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:30,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:30,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-15 10:29:30,517 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-05-15 10:29:30,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:30,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2019-05-15 10:29:30,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:30,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-05-15 10:29:30,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-15 10:29:30,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-05-15 10:29:30,573 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-05-15 10:29:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:34,950 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:34,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-15 10:29:34,950 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-05-15 10:29:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-05-15 10:29:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-05-15 10:29:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-05-15 10:29:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-05-15 10:29:34,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2019-05-15 10:29:35,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:35,053 INFO L225 Difference]: With dead ends: 45 [2019-05-15 10:29:35,053 INFO L226 Difference]: Without dead ends: 45 [2019-05-15 10:29:35,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-05-15 10:29:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-05-15 10:29:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-05-15 10:29:35,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:35,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:35,058 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:35,059 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:35,060 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:35,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:35,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:35,060 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:35,060 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:35,065 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:35,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:35,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:35,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:35,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-05-15 10:29:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-05-15 10:29:35,066 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-05-15 10:29:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:35,067 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-05-15 10:29:35,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-05-15 10:29:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-05-15 10:29:35,067 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:35,068 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-05-15 10:29:35,068 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash 907059863, now seen corresponding path program 20 times [2019-05-15 10:29:35,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:35,105 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-15 10:29:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:35,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:35,224 INFO L375 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 6 treesize of output 5 [2019-05-15 10:29:35,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:35,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_433]. (= (store v_main_a_433 main_x 0) main_a) [2019-05-15 10:29:35,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:29:35,525 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:29:35,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,539 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:29:35,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:29:35,542 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_434]. (and (= 0 (select v_main_a_434 main_x)) (= (store v_main_a_434 main_y 1000) main_a)) [2019-05-15 10:29:35,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:29:35,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:35,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:35,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:35,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,588 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:35,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,615 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:35,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:35,615 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:35,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_435]. (let ((.cse2 (select v_main_a_435 main_x))) (let ((.cse0 (= 1000 (select v_main_a_435 main_y))) (.cse1 (= (store v_main_a_435 main_x (+ .cse2 1)) main_a))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 (= .cse2 0) .cse1)))) [2019-05-15 10:29:35,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:29:35,663 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:35,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:35,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:35,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:35,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,715 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:35,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:35,715 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:35,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_436]. (let ((.cse2 (select v_main_a_436 main_y))) (let ((.cse0 (= (store v_main_a_436 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_436 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 1000) (= 1 .cse1))))) [2019-05-15 10:29:35,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:35,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:35,792 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:35,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:35,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,832 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:35,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:35,833 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:35,846 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_437]. (let ((.cse0 (select v_main_a_437 main_x))) (let ((.cse1 (= (store v_main_a_437 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_437 main_y) 999) (= .cse0 1) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:35,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:29:35,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:35,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:35,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:35,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,939 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:35,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:35,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:35,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_438]. (let ((.cse1 (select v_main_a_438 main_y))) (let ((.cse0 (select v_main_a_438 main_x)) (.cse2 (= main_a (store v_main_a_438 main_y (+ .cse1 (- 1)))))) (or (and (= 2 .cse0) (= 999 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:29:35,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:36,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:36,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,057 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:36,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:36,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:36,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_439]. (let ((.cse0 (select v_main_a_439 main_x))) (let ((.cse1 (= (store v_main_a_439 main_x (+ .cse0 1)) main_a))) (or (and (= 2 .cse0) (= 998 (select v_main_a_439 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:29:36,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:29:36,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:36,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,153 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:36,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:36,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:36,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_440]. (let ((.cse1 (select v_main_a_440 main_y))) (let ((.cse0 (select v_main_a_440 main_x)) (.cse2 (= (store v_main_a_440 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 3) (= 998 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:29:36,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:36,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:36,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,266 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:36,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:36,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:36,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_441]. (let ((.cse1 (select v_main_a_441 main_x))) (let ((.cse0 (= (store v_main_a_441 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 997 (select v_main_a_441 main_y)) (= 3 .cse1) .cse0)))) [2019-05-15 10:29:36,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:29:36,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:36,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,376 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:36,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:36,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:36,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_442]. (let ((.cse1 (select v_main_a_442 main_y))) (let ((.cse0 (= (store v_main_a_442 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_442 main_x))) (or (and .cse0 (= 997 .cse1) (= 4 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:29:36,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:36,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:36,507 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,545 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:36,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:36,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:36,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_443]. (let ((.cse1 (select v_main_a_443 main_x))) (let ((.cse0 (= (store v_main_a_443 main_x (+ .cse1 1)) main_a))) (or (and (= 996 (select v_main_a_443 main_y)) .cse0 (= .cse1 4)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:29:36,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:29:36,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:36,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,652 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:36,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:36,653 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:36,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_444]. (let ((.cse2 (select v_main_a_444 main_y))) (let ((.cse0 (select v_main_a_444 main_x)) (.cse1 (= (store v_main_a_444 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 5 .cse0) .cse1 (= 996 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:29:36,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:36,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:36,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,784 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:36,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:36,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:36,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_445]. (let ((.cse0 (select v_main_a_445 main_x))) (let ((.cse1 (= (store v_main_a_445 main_x (+ .cse0 1)) main_a))) (or (and (= 995 (select v_main_a_445 main_y)) (= 5 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:29:36,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:29:36,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:36,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,897 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:36,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:36,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:36,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_446]. (let ((.cse1 (select v_main_a_446 main_y))) (let ((.cse2 (select v_main_a_446 main_x)) (.cse0 (= (store v_main_a_446 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= 995 .cse1) (= 6 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse0)))) [2019-05-15 10:29:36,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:36,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:36,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:36,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,004 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:37,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:37,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:37,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_447]. (let ((.cse0 (select v_main_a_447 main_x))) (let ((.cse1 (= main_a (store v_main_a_447 main_x (+ .cse0 1))))) (or (and (= 994 (select v_main_a_447 main_y)) (= 6 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:29:37,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:29:37,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:37,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:37,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:37,080 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,104 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:37,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:37,105 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:37,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,140 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_448]. (let ((.cse2 (select v_main_a_448 main_y))) (let ((.cse0 (select v_main_a_448 main_x)) (.cse1 (= (store v_main_a_448 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 994 .cse2) (= 7 .cse0) .cse1)))) [2019-05-15 10:29:37,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:29:37,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:37,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:37,208 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,232 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:37,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:37,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:37,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_449]. (let ((.cse0 (select v_main_a_449 main_x))) (let ((.cse1 (= main_a (store v_main_a_449 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 993 (select v_main_a_449 main_y)) (= 7 .cse0) .cse1)))) [2019-05-15 10:29:37,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:29:37,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:37,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:37,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,359 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:37,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:37,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:37,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_450]. (let ((.cse0 (select v_main_a_450 main_y))) (let ((.cse1 (= main_a (store v_main_a_450 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_450 main_x))) (or (and (= .cse0 993) .cse1 (= .cse2 8)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:29:37,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:37,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:37,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:37,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,514 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:37,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:37,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:37,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_451]. (let ((.cse0 (select v_main_a_451 main_x))) (let ((.cse1 (= main_a (store v_main_a_451 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 8) (= 992 (select v_main_a_451 main_y)) .cse1)))) [2019-05-15 10:29:37,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:29:37,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:37,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:37,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:37,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,624 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:37,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:37,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:37,633 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_452]. (let ((.cse2 (select v_main_a_452 main_y))) (let ((.cse0 (select v_main_a_452 main_x)) (.cse1 (= (store v_main_a_452 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 992) (= 9 .cse0) .cse1)))) [2019-05-15 10:29:37,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:29:37,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:37,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:37,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,744 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:37,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:37,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:37,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,754 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_453]. (let ((.cse1 (select v_main_a_453 main_x))) (let ((.cse0 (= (store v_main_a_453 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 9) (= 991 (select v_main_a_453 main_y)))))) [2019-05-15 10:29:37,754 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:29:37,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:37,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:37,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,860 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:37,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:37,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:37,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_454]. (let ((.cse1 (select v_main_a_454 main_y))) (let ((.cse0 (= (store v_main_a_454 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_454 main_x))) (or (and .cse0 (= 991 .cse1) (= .cse2 10)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:29:37,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:37,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:37,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:37,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,001 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:38,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:38,001 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:38,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_455]. (let ((.cse0 (select v_main_a_455 main_x))) (let ((.cse1 (= (store v_main_a_455 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_455 main_y) 990) (= 10 .cse0) .cse1)))) [2019-05-15 10:29:38,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:29:38,070 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:38,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:38,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:38,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,094 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:38,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,121 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:38,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:38,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:38,131 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_456]. (let ((.cse2 (select v_main_a_456 main_y))) (let ((.cse0 (select v_main_a_456 main_x)) (.cse1 (= (store v_main_a_456 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 990 .cse2) (= .cse0 11) .cse1)))) [2019-05-15 10:29:38,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:29:38,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:38,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:38,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:38,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,238 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:38,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:38,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:38,252 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,253 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_457]. (let ((.cse1 (select v_main_a_457 main_x))) (let ((.cse0 (= (store v_main_a_457 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_457 main_y) 989) .cse0 (= 11 .cse1))))) [2019-05-15 10:29:38,253 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:29:38,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:38,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:38,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:38,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:38,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,364 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:38,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:38,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:38,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_458]. (let ((.cse2 (select v_main_a_458 main_y))) (let ((.cse0 (= (store v_main_a_458 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_458 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= 989 .cse2) (= .cse1 12))))) [2019-05-15 10:29:38,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:38,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:38,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:38,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:38,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,581 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:38,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:38,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:38,589 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_459]. (let ((.cse0 (select v_main_a_459 main_x))) (let ((.cse1 (= (store v_main_a_459 main_x (+ .cse0 1)) main_a))) (or (and (= 12 .cse0) (= (select v_main_a_459 main_y) 988) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:29:38,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:29:38,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:38,750 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:38,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:38,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,795 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:38,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:38,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:38,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_460]. (let ((.cse0 (select v_main_a_460 main_y))) (let ((.cse1 (select v_main_a_460 main_x)) (.cse2 (= main_a (store v_main_a_460 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 988) (= 13 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:29:38,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:38,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:38,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:38,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:38,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,944 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:38,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:38,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:38,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,955 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_461]. (let ((.cse1 (select v_main_a_461 main_x))) (let ((.cse0 (= main_a (store v_main_a_461 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 13) .cse0 (= 987 (select v_main_a_461 main_y)))))) [2019-05-15 10:29:38,955 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:29:39,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:39,046 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:39,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:39,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,091 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:39,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:39,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:39,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_462]. (let ((.cse1 (select v_main_a_462 main_y))) (let ((.cse0 (select v_main_a_462 main_x)) (.cse2 (= (store v_main_a_462 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 14 .cse0) (= .cse1 987) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:29:39,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:29:39,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:39,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:39,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:39,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,244 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:39,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:39,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:39,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_463]. (let ((.cse0 (select v_main_a_463 main_x))) (let ((.cse1 (= (store v_main_a_463 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_463 main_y) 986) .cse1 (= .cse0 14))))) [2019-05-15 10:29:39,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:29:39,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:39,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:39,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:39,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:39,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,372 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:39,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:39,373 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:39,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_464]. (let ((.cse2 (select v_main_a_464 main_y))) (let ((.cse1 (= (store v_main_a_464 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_464 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 986) .cse1 (= 15 .cse0))))) [2019-05-15 10:29:39,412 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:39,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:39,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:39,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:39,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,529 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:39,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:39,530 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:39,543 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_465]. (let ((.cse1 (select v_main_a_465 main_x))) (let ((.cse0 (= (store v_main_a_465 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 15) (= 985 (select v_main_a_465 main_y)))))) [2019-05-15 10:29:39,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:29:39,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:39,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:39,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:39,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,672 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:39,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:39,673 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:39,705 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,705 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_466]. (let ((.cse1 (select v_main_a_466 main_y))) (let ((.cse0 (select v_main_a_466 main_x)) (.cse2 (= (store v_main_a_466 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 16 .cse0) (= .cse1 985) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:29:39,705 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:39,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:39,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:39,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:39,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,843 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:39,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:39,843 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:39,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_467]. (let ((.cse1 (select v_main_a_467 main_x))) (let ((.cse0 (= (store v_main_a_467 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 16) (= 984 (select v_main_a_467 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:39,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:29:39,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:39,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:39,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:39,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:39,944 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,966 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:39,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:39,967 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:39,976 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_468]. (let ((.cse2 (select v_main_a_468 main_y))) (let ((.cse0 (select v_main_a_468 main_x)) (.cse1 (= (store v_main_a_468 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 984) (= 17 .cse0) .cse1)))) [2019-05-15 10:29:39,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:29:40,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:40,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:40,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:40,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,086 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:40,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:40,087 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:40,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_469]. (let ((.cse0 (select v_main_a_469 main_x))) (let ((.cse1 (= (store v_main_a_469 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 17 .cse0) (= (select v_main_a_469 main_y) 983) .cse1)))) [2019-05-15 10:29:40,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:29:40,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:40,187 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:40,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:40,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,230 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:40,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:40,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:40,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_470]. (let ((.cse0 (select v_main_a_470 main_y))) (let ((.cse2 (select v_main_a_470 main_x)) (.cse1 (= (store v_main_a_470 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 983) .cse1 (= .cse2 18)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:29:40,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:40,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:40,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:40,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:40,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,383 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:40,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:40,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:40,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_471]. (let ((.cse0 (select v_main_a_471 main_x))) (let ((.cse1 (= (store v_main_a_471 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_471 main_y) 982) (= .cse0 18) .cse1)))) [2019-05-15 10:29:40,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:29:40,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:40,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:40,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:40,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,513 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:40,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:40,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:40,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,524 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_472]. (let ((.cse0 (select v_main_a_472 main_y))) (let ((.cse2 (select v_main_a_472 main_x)) (.cse1 (= main_a (store v_main_a_472 main_y (+ .cse0 (- 1)))))) (or (and (= 982 .cse0) .cse1 (= 19 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:29:40,524 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:29:40,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:40,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:40,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:40,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,674 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:40,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:40,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:40,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_473]. (let ((.cse0 (select v_main_a_473 main_x))) (let ((.cse1 (= (store v_main_a_473 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 19) (= (select v_main_a_473 main_y) 981) .cse1)))) [2019-05-15 10:29:40,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:29:40,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:40,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:40,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:40,787 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,822 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:40,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:40,823 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:40,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_474]. (let ((.cse0 (select v_main_a_474 main_y))) (let ((.cse2 (= (store v_main_a_474 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_474 main_x))) (or (and (= .cse0 981) (= .cse1 20) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:29:40,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:40,950 INFO L273 TraceCheckUtils]: 0: Hoare triple {3915#true} a := a[x := 0]; {3920#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:29:40,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {3920#(= (select main_a main_x) 0)} a := a[y := 1000]; {3924#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:29:40,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {3924#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {3928#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:29:40,953 INFO L273 TraceCheckUtils]: 3: Hoare triple {3928#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {3932#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,953 INFO L273 TraceCheckUtils]: 4: Hoare triple {3932#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3936#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:29:40,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {3936#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {3940#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {3940#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3944#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:29:40,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {3944#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {3948#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {3948#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3952#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:29:40,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {3952#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {3956#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {3956#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3960#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:29:40,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {3960#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {3964#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {3964#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {3968#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:29:40,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {3968#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {3972#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:29:40,965 INFO L273 TraceCheckUtils]: 14: Hoare triple {3972#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {3976#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:29:40,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {3976#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {3980#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:40,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {3980#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {3984#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:40,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {3984#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {3988#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:40,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {3988#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {3992#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:40,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {3992#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {3996#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {3996#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4000#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:29:40,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {4000#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {4004#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {4004#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4008#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:29:40,976 INFO L273 TraceCheckUtils]: 23: Hoare triple {4008#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {4012#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:29:40,977 INFO L273 TraceCheckUtils]: 24: Hoare triple {4012#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {4016#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:29:40,978 INFO L273 TraceCheckUtils]: 25: Hoare triple {4016#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {4020#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,979 INFO L273 TraceCheckUtils]: 26: Hoare triple {4020#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4024#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:29:40,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {4024#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {4028#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {4028#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4032#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:29:40,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {4032#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {4036#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:40,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {4036#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {4040#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:40,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {4040#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {4044#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {4044#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4048#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:29:40,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {4048#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {4052#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,988 INFO L273 TraceCheckUtils]: 34: Hoare triple {4052#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4056#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:40,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {4056#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {4060#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:40,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {4060#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {4064#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:29:40,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {4064#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {4068#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {4068#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4072#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:29:40,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {4072#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {4076#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:29:40,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {4076#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {4080#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:29:40,996 INFO L273 TraceCheckUtils]: 41: Hoare triple {4080#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {4084#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:40,997 INFO L273 TraceCheckUtils]: 42: Hoare triple {4084#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {3916#false} is VALID [2019-05-15 10:29:40,997 INFO L273 TraceCheckUtils]: 43: Hoare triple {3916#false} assume !(a[y] <= 0); {3916#false} is VALID [2019-05-15 10:29:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:41,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:41,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-15 10:29:41,006 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-05-15 10:29:41,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:41,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2019-05-15 10:29:41,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:41,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-05-15 10:29:41,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-15 10:29:41,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-05-15 10:29:41,069 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-05-15 10:29:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:45,949 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:29:45,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-15 10:29:45,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-05-15 10:29:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-05-15 10:29:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-05-15 10:29:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-05-15 10:29:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-05-15 10:29:45,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2019-05-15 10:29:46,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:46,032 INFO L225 Difference]: With dead ends: 47 [2019-05-15 10:29:46,032 INFO L226 Difference]: Without dead ends: 47 [2019-05-15 10:29:46,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-05-15 10:29:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-05-15 10:29:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-05-15 10:29:46,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:46,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:46,035 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:46,035 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:46,036 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:29:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:29:46,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:46,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:46,037 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:46,037 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:46,038 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:29:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:29:46,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:46,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:46,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:46,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-05-15 10:29:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-05-15 10:29:46,039 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-05-15 10:29:46,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:46,040 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-05-15 10:29:46,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-05-15 10:29:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:29:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-05-15 10:29:46,040 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:46,041 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-05-15 10:29:46,041 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:46,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:46,041 INFO L82 PathProgramCache]: Analyzing trace with hash -193986184, now seen corresponding path program 21 times [2019-05-15 10:29:46,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:46,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-15 10:29:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:46,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:46,179 INFO L375 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 6 treesize of output 5 [2019-05-15 10:29:46,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:46,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_475]. (= main_a (store v_main_a_475 main_x 0)) [2019-05-15 10:29:46,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:29:46,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:29:46,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,224 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:29:46,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:29:46,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_476]. (and (= 0 (select v_main_a_476 main_x)) (= main_a (store v_main_a_476 main_y 1000))) [2019-05-15 10:29:46,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:29:46,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:46,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:46,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:46,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:46,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,298 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:46,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:46,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:46,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,308 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_477]. (let ((.cse2 (select v_main_a_477 main_x))) (let ((.cse0 (= (store v_main_a_477 main_x (+ .cse2 1)) main_a)) (.cse1 (= 1000 (select v_main_a_477 main_y)))) (or (and (= main_y main_x) .cse0 .cse1) (and (= 0 .cse2) .cse0 .cse1)))) [2019-05-15 10:29:46,308 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:29:46,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:46,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:46,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:46,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,389 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:46,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:46,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:46,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_478]. (let ((.cse2 (select v_main_a_478 main_y))) (let ((.cse0 (select v_main_a_478 main_x)) (.cse1 (= (store v_main_a_478 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 1) .cse1 (= .cse2 1000)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:29:46,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:46,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:46,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:46,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,464 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:46,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,501 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:46,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:46,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:46,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_479]. (let ((.cse1 (select v_main_a_479 main_x))) (let ((.cse0 (= (store v_main_a_479 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 1) (= (select v_main_a_479 main_y) 999))))) [2019-05-15 10:29:46,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:29:46,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:46,566 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:46,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:46,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,609 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:46,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:46,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:46,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_480]. (let ((.cse2 (select v_main_a_480 main_y))) (let ((.cse0 (= (store v_main_a_480 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_480 main_x))) (or (and .cse0 (= 2 .cse1) (= 999 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:29:46,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:46,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:46,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:46,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:46,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,727 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:46,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:46,728 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:46,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_481]. (let ((.cse1 (select v_main_a_481 main_x))) (let ((.cse0 (= (store v_main_a_481 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 2 .cse1) .cse0 (= 998 (select v_main_a_481 main_y)))))) [2019-05-15 10:29:46,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:29:46,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:46,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:46,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:46,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,831 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:46,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:46,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:46,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_482]. (let ((.cse1 (select v_main_a_482 main_y))) (let ((.cse0 (select v_main_a_482 main_x)) (.cse2 (= (store v_main_a_482 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 3 .cse0) (= 998 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:29:46,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:46,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:46,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:46,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:46,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:46,933 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:46,956 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:46,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:46,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:46,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:46,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_483]. (let ((.cse0 (select v_main_a_483 main_x))) (let ((.cse1 (= (store v_main_a_483 main_x (+ .cse0 1)) main_a))) (or (and (= 3 .cse0) (= (select v_main_a_483 main_y) 997) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:29:46,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:29:47,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:47,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:47,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,051 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:47,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:47,117 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_484]. (let ((.cse2 (select v_main_a_484 main_y))) (let ((.cse0 (= (store v_main_a_484 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_484 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 997) (= .cse1 4))))) [2019-05-15 10:29:47,117 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:47,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:47,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,212 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:47,221 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:47,221 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_485]. (let ((.cse1 (select v_main_a_485 main_x))) (let ((.cse0 (= (store v_main_a_485 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 4 .cse1) (= 996 (select v_main_a_485 main_y)) .cse0)))) [2019-05-15 10:29:47,221 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:29:47,260 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:47,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:47,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,284 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,308 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,308 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:47,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:47,344 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_486]. (let ((.cse2 (select v_main_a_486 main_y))) (let ((.cse0 (= (store v_main_a_486 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_486 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 996 .cse2) (= 5 .cse1))))) [2019-05-15 10:29:47,344 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:47,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:47,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,433 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:47,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:47,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_487]. (let ((.cse1 (select v_main_a_487 main_x))) (let ((.cse0 (= (store v_main_a_487 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 995 (select v_main_a_487 main_y)) (= 5 .cse1))))) [2019-05-15 10:29:47,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:29:47,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,505 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:47,514 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,548 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,549 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:47,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:47,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_488]. (let ((.cse1 (select v_main_a_488 main_y))) (let ((.cse0 (select v_main_a_488 main_x)) (.cse2 (= (store v_main_a_488 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 6 .cse0) (= 995 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:29:47,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:47,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:47,650 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,674 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,675 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:47,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:47,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_489]. (let ((.cse0 (select v_main_a_489 main_x))) (let ((.cse1 (= (store v_main_a_489 main_x (+ .cse0 1)) main_a))) (or (and (= 6 .cse0) .cse1 (= 994 (select v_main_a_489 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:29:47,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:29:47,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,750 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:47,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,782 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:47,793 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:47,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_490]. (let ((.cse0 (select v_main_a_490 main_y))) (let ((.cse1 (select v_main_a_490 main_x)) (.cse2 (= main_a (store v_main_a_490 main_y (+ .cse0 (- 1)))))) (or (and (= 994 .cse0) (= .cse1 7) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:29:47,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:29:47,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:47,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,885 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:47,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:47,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_491]. (let ((.cse1 (select v_main_a_491 main_x))) (let ((.cse0 (= main_a (store v_main_a_491 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 993 (select v_main_a_491 main_y)) (= 7 .cse1))))) [2019-05-15 10:29:47,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:29:47,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:47,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:47,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:47,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:47,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:47,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:47,993 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:47,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:47,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:48,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:48,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_492]. (let ((.cse2 (select v_main_a_492 main_y))) (let ((.cse0 (select v_main_a_492 main_x)) (.cse1 (= (store v_main_a_492 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 8) (= 993 .cse2) .cse1)))) [2019-05-15 10:29:48,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:29:48,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:48,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:48,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:48,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:48,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,124 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:48,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:48,125 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:48,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:48,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_493]. (let ((.cse0 (select v_main_a_493 main_x))) (let ((.cse1 (= (store v_main_a_493 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 8) (= (select v_main_a_493 main_y) 992) .cse1)))) [2019-05-15 10:29:48,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:29:48,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:48,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:48,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:48,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:48,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,236 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:48,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:48,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:48,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:48,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_494]. (let ((.cse0 (select v_main_a_494 main_y))) (let ((.cse2 (select v_main_a_494 main_x)) (.cse1 (= (store v_main_a_494 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 992) .cse1 (= 9 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:29:48,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:29:48,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:48,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:48,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:48,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:48,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,355 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:48,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:48,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:48,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:48,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_495]. (let ((.cse1 (select v_main_a_495 main_x))) (let ((.cse0 (= (store v_main_a_495 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 9 .cse1) (= (select v_main_a_495 main_y) 991))))) [2019-05-15 10:29:48,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:29:48,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:48,698 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:48,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:48,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:48,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,739 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:48,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:48,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:48,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:48,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_496]. (let ((.cse0 (select v_main_a_496 main_y))) (let ((.cse1 (select v_main_a_496 main_x)) (.cse2 (= (store v_main_a_496 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 991 .cse0) (= .cse1 10) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:29:48,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:48,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:48,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:48,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:48,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:48,944 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:48,996 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:48,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:48,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:49,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_497]. (let ((.cse0 (select v_main_a_497 main_x))) (let ((.cse1 (= (store v_main_a_497 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 10) .cse1 (= 990 (select v_main_a_497 main_y))) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:29:49,008 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:29:49,065 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:49,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:49,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:49,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:49,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,117 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:49,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:49,118 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:49,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_498]. (let ((.cse2 (select v_main_a_498 main_y))) (let ((.cse1 (select v_main_a_498 main_x)) (.cse0 (= (store v_main_a_498 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 11) (= .cse2 990) .cse0)))) [2019-05-15 10:29:49,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:29:49,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:49,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:49,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:49,217 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,243 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:49,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:49,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:49,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_499]. (let ((.cse1 (select v_main_a_499 main_x))) (let ((.cse0 (= (store v_main_a_499 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_499 main_y) 989) (= 11 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:29:49,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:29:49,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:49,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:49,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:49,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,368 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:49,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:49,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:49,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_500]. (let ((.cse1 (select v_main_a_500 main_y))) (let ((.cse0 (= (store v_main_a_500 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_500 main_x))) (or (and .cse0 (= .cse1 989) (= 12 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:29:49,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:49,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:49,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:49,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:49,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,550 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:49,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:49,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:49,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_501]. (let ((.cse1 (select v_main_a_501 main_x))) (let ((.cse0 (= (store v_main_a_501 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 12 .cse1) (= 988 (select v_main_a_501 main_y)))))) [2019-05-15 10:29:49,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:29:49,623 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:49,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:49,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:49,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:49,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,685 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:49,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:49,686 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:49,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_502]. (let ((.cse2 (select v_main_a_502 main_y))) (let ((.cse1 (select v_main_a_502 main_x)) (.cse0 (= (store v_main_a_502 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= .cse2 988) (= 13 .cse1) .cse0)))) [2019-05-15 10:29:49,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:49,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:49,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:49,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:49,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,862 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:49,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:49,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:49,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_503]. (let ((.cse1 (select v_main_a_503 main_x))) (let ((.cse0 (= (store v_main_a_503 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 13 .cse1) .cse0 (= 987 (select v_main_a_503 main_y)))))) [2019-05-15 10:29:49,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:29:49,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:49,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:49,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:49,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:49,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,005 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:50,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:50,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:50,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_504]. (let ((.cse2 (select v_main_a_504 main_y))) (let ((.cse0 (= (store v_main_a_504 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_504 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 14 .cse1) (= .cse2 987))))) [2019-05-15 10:29:50,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:29:50,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:50,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:50,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:50,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,139 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:50,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:50,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:50,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_505]. (let ((.cse1 (select v_main_a_505 main_x))) (let ((.cse0 (= (store v_main_a_505 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 14 .cse1) .cse0 (= 986 (select v_main_a_505 main_y)))))) [2019-05-15 10:29:50,152 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:29:50,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:50,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:50,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:50,247 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,273 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:50,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:50,273 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:50,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_506]. (let ((.cse0 (select v_main_a_506 main_y))) (let ((.cse1 (= (store v_main_a_506 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_506 main_x))) (or (and (= 986 .cse0) .cse1 (= 15 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:29:50,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:50,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:50,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:50,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:50,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,443 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:50,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:50,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:50,456 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_507]. (let ((.cse0 (select v_main_a_507 main_x))) (let ((.cse1 (= main_a (store v_main_a_507 main_x (+ .cse0 1))))) (or (and (= 15 .cse0) (= 985 (select v_main_a_507 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:29:50,456 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:29:50,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:50,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:50,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:50,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:50,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,583 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:50,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:50,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:50,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_508]. (let ((.cse2 (select v_main_a_508 main_y))) (let ((.cse0 (select v_main_a_508 main_x)) (.cse1 (= (store v_main_a_508 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 985) (= 16 .cse0) .cse1)))) [2019-05-15 10:29:50,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:50,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:50,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:50,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:50,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,739 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:50,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:50,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:50,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_509]. (let ((.cse1 (select v_main_a_509 main_x))) (let ((.cse0 (= (store v_main_a_509 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 16) (= (select v_main_a_509 main_y) 984))))) [2019-05-15 10:29:50,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:29:50,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:50,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:50,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:50,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:50,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,866 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:50,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:50,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:50,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_510]. (let ((.cse2 (select v_main_a_510 main_y))) (let ((.cse0 (select v_main_a_510 main_x)) (.cse1 (= main_a (store v_main_a_510 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 17) (= .cse2 984) .cse1)))) [2019-05-15 10:29:50,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:29:50,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:50,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:50,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:50,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,991 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:50,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:50,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:51,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_511]. (let ((.cse1 (select v_main_a_511 main_x))) (let ((.cse0 (= (store v_main_a_511 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_511 main_y) 983) .cse0 (= .cse1 17))))) [2019-05-15 10:29:51,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:29:51,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:51,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:51,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:51,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:51,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,129 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:51,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:51,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:51,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_512]. (let ((.cse2 (select v_main_a_512 main_y))) (let ((.cse1 (select v_main_a_512 main_x)) (.cse0 (= (store v_main_a_512 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 18 .cse1) (= 983 .cse2) .cse0)))) [2019-05-15 10:29:51,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:51,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:51,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:51,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,446 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:29:51,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:51,449 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,472 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:51,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:51,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:51,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_513]. (let ((.cse1 (select v_main_a_513 main_x))) (let ((.cse0 (= (store v_main_a_513 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_513 main_y) 982) .cse0 (= .cse1 18))))) [2019-05-15 10:29:51,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:29:51,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:51,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:51,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:51,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,600 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:51,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:51,601 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:51,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,620 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_514]. (let ((.cse1 (select v_main_a_514 main_y))) (let ((.cse0 (= (store v_main_a_514 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_514 main_x))) (or (and .cse0 (= .cse1 982) (= .cse2 19)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:29:51,620 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:29:51,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:51,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:51,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:51,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,749 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:51,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:51,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:51,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_515]. (let ((.cse1 (select v_main_a_515 main_x))) (let ((.cse0 (= (store v_main_a_515 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 981 (select v_main_a_515 main_y)) (= 19 .cse1) .cse0)))) [2019-05-15 10:29:51,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:29:51,836 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:51,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:51,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:51,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:51,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,895 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:51,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:51,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:51,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_516]. (let ((.cse2 (select v_main_a_516 main_y))) (let ((.cse0 (= main_a (store v_main_a_516 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_516 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 981 .cse2) .cse0 (= 20 .cse1))))) [2019-05-15 10:29:51,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:52,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:52,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:52,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:52,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:52,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:52,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:52,107 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:52,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:52,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:52,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:52,117 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_517]. (let ((.cse0 (select v_main_a_517 main_x))) (let ((.cse1 (= (store v_main_a_517 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 20) (= 980 (select v_main_a_517 main_y)))))) [2019-05-15 10:29:52,117 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:29:52,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:52,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:52,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:52,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:52,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:52,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:52,243 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:52,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:52,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:52,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:52,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_518]. (let ((.cse0 (select v_main_a_518 main_y))) (let ((.cse1 (= main_a (store v_main_a_518 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_518 main_x))) (or (and (= .cse0 980) .cse1 (= 21 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:29:52,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:52,417 INFO L273 TraceCheckUtils]: 0: Hoare triple {4278#true} a := a[x := 0]; {4283#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:29:52,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {4283#(= (select main_a main_x) 0)} a := a[y := 1000]; {4287#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:29:52,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {4287#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {4291#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:29:52,420 INFO L273 TraceCheckUtils]: 3: Hoare triple {4291#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {4295#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,422 INFO L273 TraceCheckUtils]: 4: Hoare triple {4295#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4299#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:29:52,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {4299#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {4303#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {4303#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4307#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:29:52,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {4307#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {4311#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {4311#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4315#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:29:52,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {4315#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {4319#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {4319#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4323#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:29:52,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {4323#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {4327#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {4327#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4331#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:29:52,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {4331#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {4335#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:29:52,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {4335#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {4339#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:29:52,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {4339#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {4343#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:52,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {4343#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {4347#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:29:52,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {4347#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {4351#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:52,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {4351#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {4355#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:29:52,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {4355#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {4359#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {4359#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4363#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:29:52,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {4363#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {4367#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {4367#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4371#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:29:52,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {4371#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {4375#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:29:52,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {4375#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {4379#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:29:52,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {4379#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {4383#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,460 INFO L273 TraceCheckUtils]: 26: Hoare triple {4383#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4387#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:29:52,461 INFO L273 TraceCheckUtils]: 27: Hoare triple {4387#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {4391#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {4391#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4395#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:29:52,463 INFO L273 TraceCheckUtils]: 29: Hoare triple {4395#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {4399#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:52,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {4399#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {4403#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:29:52,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {4403#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {4407#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,467 INFO L273 TraceCheckUtils]: 32: Hoare triple {4407#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4411#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:29:52,468 INFO L273 TraceCheckUtils]: 33: Hoare triple {4411#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {4415#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,469 INFO L273 TraceCheckUtils]: 34: Hoare triple {4415#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4419#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:52,470 INFO L273 TraceCheckUtils]: 35: Hoare triple {4419#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {4423#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:29:52,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {4423#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {4427#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:29:52,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {4427#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {4431#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {4431#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4435#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:29:52,475 INFO L273 TraceCheckUtils]: 39: Hoare triple {4435#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {4439#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:29:52,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {4439#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {4443#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:29:52,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {4443#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {4447#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {4447#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4451#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:29:52,479 INFO L273 TraceCheckUtils]: 43: Hoare triple {4451#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {4455#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:29:52,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {4455#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {4279#false} is VALID [2019-05-15 10:29:52,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {4279#false} assume !(a[y] <= 0); {4279#false} is VALID [2019-05-15 10:29:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:52,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:52,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-15 10:29:52,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-05-15 10:29:52,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:52,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2019-05-15 10:29:52,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:52,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-05-15 10:29:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-15 10:29:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-05-15 10:29:52,548 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-05-15 10:29:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:57,765 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:29:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-15 10:29:57,766 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-05-15 10:29:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-05-15 10:29:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-05-15 10:29:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-05-15 10:29:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-05-15 10:29:57,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2019-05-15 10:29:57,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:57,839 INFO L225 Difference]: With dead ends: 49 [2019-05-15 10:29:57,839 INFO L226 Difference]: Without dead ends: 49 [2019-05-15 10:29:57,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-05-15 10:29:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-05-15 10:29:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-05-15 10:29:57,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:57,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2019-05-15 10:29:57,842 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2019-05-15 10:29:57,842 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2019-05-15 10:29:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:57,842 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:29:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:29:57,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:57,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:57,843 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2019-05-15 10:29:57,843 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2019-05-15 10:29:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:57,843 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:29:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:29:57,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:57,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:57,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:57,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-05-15 10:29:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-05-15 10:29:57,845 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-05-15 10:29:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:57,845 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-05-15 10:29:57,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-05-15 10:29:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:29:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-05-15 10:29:57,845 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:57,845 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-05-15 10:29:57,846 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1737282535, now seen corresponding path program 22 times [2019-05-15 10:29:57,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:57,885 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-15 10:29:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:57,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:58,001 INFO L375 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 6 treesize of output 5 [2019-05-15 10:29:58,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:58,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:58,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:58,052 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_519]. (= (store v_main_a_519 main_x 0) main_a) [2019-05-15 10:29:58,052 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:29:58,466 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-05-15 10:29:58,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:58,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:29:58,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,563 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:29:58,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:29:58,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:58,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_520]. (and (= (store v_main_a_520 main_y 1000) main_a) (= (select v_main_a_520 main_x) 0)) [2019-05-15 10:29:58,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:29:58,589 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:29:58,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:58,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:58,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:58,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:58,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,635 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:58,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:58,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:58,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:58,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_521]. (let ((.cse2 (select v_main_a_521 main_x))) (let ((.cse0 (= main_a (store v_main_a_521 main_x (+ .cse2 1)))) (.cse1 (= (select v_main_a_521 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:29:58,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:29:58,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:58,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:58,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:58,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:58,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,805 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:58,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:58,806 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:58,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:58,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_522]. (let ((.cse1 (select v_main_a_522 main_y))) (let ((.cse0 (select v_main_a_522 main_x)) (.cse2 (= (store v_main_a_522 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 1 .cse0) (= 1000 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:29:58,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:58,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:58,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:58,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:58,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:58,880 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:58,915 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:58,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:58,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:58,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:58,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_523]. (let ((.cse0 (select v_main_a_523 main_x))) (let ((.cse1 (= (store v_main_a_523 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 1) .cse1 (= 999 (select v_main_a_523 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:29:58,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:29:58,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:59,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:59,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:59,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:59,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,096 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:59,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:59,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:59,126 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:59,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_524]. (let ((.cse0 (select v_main_a_524 main_y))) (let ((.cse1 (select v_main_a_524 main_x)) (.cse2 (= (store v_main_a_524 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 999 .cse0) (= 2 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:29:59,126 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:59,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:59,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:59,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:59,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:59,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,396 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:59,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:59,396 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:59,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:59,409 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_525]. (let ((.cse1 (select v_main_a_525 main_x))) (let ((.cse0 (= main_a (store v_main_a_525 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 998 (select v_main_a_525 main_y)) .cse0 (= 2 .cse1))))) [2019-05-15 10:29:59,409 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:29:59,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:59,464 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:59,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:59,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:59,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,496 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:59,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:59,497 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:59,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:59,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_526]. (let ((.cse0 (select v_main_a_526 main_y))) (let ((.cse2 (= (store v_main_a_526 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_526 main_x))) (or (and (= .cse0 998) (= .cse1 3) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:29:59,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:59,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:59,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:59,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:59,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:59,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,629 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:59,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:59,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:59,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:59,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_527]. (let ((.cse1 (select v_main_a_527 main_x))) (let ((.cse0 (= (store v_main_a_527 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_527 main_y) 997) (= .cse1 3)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:29:59,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:29:59,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:59,699 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:59,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:59,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:59,707 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,731 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:59,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:59,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:59,773 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:59,773 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_528]. (let ((.cse2 (select v_main_a_528 main_y))) (let ((.cse0 (select v_main_a_528 main_x)) (.cse1 (= (store v_main_a_528 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 4) .cse1 (= 997 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:29:59,773 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:29:59,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:59,831 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:59,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:59,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:29:59,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,873 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:59,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:59,874 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:29:59,885 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:59,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_529]. (let ((.cse1 (select v_main_a_529 main_x))) (let ((.cse0 (= (store v_main_a_529 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_529 main_y) 996) (= 4 .cse1)) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:29:59,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:29:59,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:59,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:59,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:29:59,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:29:59,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:59,975 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:29:59,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:29:59,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:00,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:00,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_530]. (let ((.cse1 (select v_main_a_530 main_y))) (let ((.cse0 (= main_a (store v_main_a_530 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_530 main_x))) (or (and .cse0 (= .cse1 996) (= 5 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:30:00,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:00,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:00,428 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:30:00,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:00,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:00,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:00,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,482 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:00,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:00,482 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:00,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:00,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_531]. (let ((.cse1 (select v_main_a_531 main_x))) (let ((.cse0 (= (store v_main_a_531 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 995 (select v_main_a_531 main_y)) (= .cse1 5)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:30:00,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:30:00,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:00,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:00,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:00,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:00,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,600 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:00,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:00,601 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:00,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:00,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_532]. (let ((.cse1 (select v_main_a_532 main_y))) (let ((.cse0 (= main_a (store v_main_a_532 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_532 main_x))) (or (and .cse0 (= 995 .cse1) (= 6 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:30:00,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:00,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:00,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:00,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,009 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:30:01,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:01,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,503 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:30:01,503 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:01,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:01,504 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:01,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_533]. (let ((.cse1 (select v_main_a_533 main_x))) (let ((.cse0 (= main_a (store v_main_a_533 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_533 main_y) 994) (= .cse1 6))))) [2019-05-15 10:30:01,519 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:30:02,118 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-15 10:30:02,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:02,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:02,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:02,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:02,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,212 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:02,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:02,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:02,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,223 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_534]. (let ((.cse2 (select v_main_a_534 main_y))) (let ((.cse1 (= (store v_main_a_534 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_534 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 994) (= .cse0 7))))) [2019-05-15 10:30:02,223 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:30:02,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:02,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:02,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:02,296 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,321 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:02,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:02,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:02,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_535]. (let ((.cse1 (select v_main_a_535 main_x))) (let ((.cse0 (= main_a (store v_main_a_535 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 7 .cse1) (= (select v_main_a_535 main_y) 993))))) [2019-05-15 10:30:02,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:30:02,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:02,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:02,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:02,417 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,443 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:02,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:02,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:02,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_536]. (let ((.cse1 (select v_main_a_536 main_y))) (let ((.cse0 (select v_main_a_536 main_x)) (.cse2 (= (store v_main_a_536 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 8) (= 993 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:30:02,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:02,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:02,542 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:02,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:02,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,579 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:02,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:02,580 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:02,595 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,595 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_537]. (let ((.cse1 (select v_main_a_537 main_x))) (let ((.cse0 (= (store v_main_a_537 main_x (+ .cse1 1)) main_a))) (or (and (= 992 (select v_main_a_537 main_y)) .cse0 (= 8 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:02,595 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:30:02,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:02,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:02,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:02,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:02,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,698 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:02,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:02,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:02,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_538]. (let ((.cse2 (select v_main_a_538 main_y))) (let ((.cse0 (= (store v_main_a_538 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_538 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 992 .cse2) .cse0 (= .cse1 9))))) [2019-05-15 10:30:02,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:30:02,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:02,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:02,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:02,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,830 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:02,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:02,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:02,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_539]. (let ((.cse0 (select v_main_a_539 main_x))) (let ((.cse1 (= (store v_main_a_539 main_x (+ .cse0 1)) main_a))) (or (and (= 9 .cse0) (= (select v_main_a_539 main_y) 991) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:02,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:30:02,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:02,920 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:02,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:02,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,955 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:02,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:02,956 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:02,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_540]. (let ((.cse2 (select v_main_a_540 main_y))) (let ((.cse1 (= (store v_main_a_540 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_540 main_x))) (or (and (= 10 .cse0) .cse1 (= 991 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:30:02,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:03,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:03,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:03,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:03,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,097 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:03,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:03,098 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:03,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_541]. (let ((.cse1 (select v_main_a_541 main_x))) (let ((.cse0 (= (store v_main_a_541 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 10 .cse1) (= 990 (select v_main_a_541 main_y)))))) [2019-05-15 10:30:03,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:30:03,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:03,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:03,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:03,198 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,224 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:03,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:03,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:03,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_542]. (let ((.cse0 (select v_main_a_542 main_y))) (let ((.cse1 (= (store v_main_a_542 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_542 main_x))) (or (and (= 990 .cse0) .cse1 (= .cse2 11)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:30:03,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:30:03,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:03,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:03,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,350 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:03,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,379 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:03,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:03,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:03,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_543]. (let ((.cse0 (select v_main_a_543 main_x))) (let ((.cse1 (= main_a (store v_main_a_543 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 11 .cse0) .cse1 (= (select v_main_a_543 main_y) 989))))) [2019-05-15 10:30:03,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:30:03,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:03,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:03,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:03,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,506 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:03,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:03,506 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:03,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_544]. (let ((.cse2 (select v_main_a_544 main_y))) (let ((.cse1 (= main_a (store v_main_a_544 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_544 main_x))) (or (and (= 12 .cse0) .cse1 (= .cse2 989)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:30:03,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:03,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:03,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:03,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:03,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,699 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:03,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:03,700 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:03,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_545]. (let ((.cse0 (select v_main_a_545 main_x))) (let ((.cse1 (= (store v_main_a_545 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 988 (select v_main_a_545 main_y)) (= .cse0 12) .cse1)))) [2019-05-15 10:30:03,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:30:03,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:03,797 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:03,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:03,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,857 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:03,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:03,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:03,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_546]. (let ((.cse1 (select v_main_a_546 main_y))) (let ((.cse0 (select v_main_a_546 main_x)) (.cse2 (= (store v_main_a_546 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 13 .cse0) (= 988 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:30:03,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:03,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:03,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:03,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:03,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,033 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:04,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:04,034 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:04,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:04,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_547]. (let ((.cse1 (select v_main_a_547 main_x))) (let ((.cse0 (= (store v_main_a_547 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 13) (= 987 (select v_main_a_547 main_y))) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:30:04,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:30:04,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:04,181 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:04,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:04,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:04,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,260 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:04,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:04,260 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:04,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:04,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_548]. (let ((.cse0 (select v_main_a_548 main_y))) (let ((.cse2 (= (store v_main_a_548 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_548 main_x))) (or (and (= .cse0 987) (= 14 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:30:04,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:30:04,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:04,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:04,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:04,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:04,496 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,526 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:04,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:04,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:04,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:04,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_549]. (let ((.cse0 (select v_main_a_549 main_x))) (let ((.cse1 (= (store v_main_a_549 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 14) .cse1 (= 986 (select v_main_a_549 main_y))) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:30:04,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:30:04,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:04,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:04,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:04,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:04,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,710 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:04,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:04,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:04,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:04,759 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_550]. (let ((.cse0 (select v_main_a_550 main_y))) (let ((.cse1 (= (store v_main_a_550 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_550 main_x))) (or (and (= 986 .cse0) .cse1 (= 15 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:30:04,759 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:04,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:04,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:04,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:04,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:04,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,869 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:04,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:04,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:04,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:04,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_551]. (let ((.cse0 (select v_main_a_551 main_x))) (let ((.cse1 (= (store v_main_a_551 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 985 (select v_main_a_551 main_y)) (= 15 .cse0) .cse1)))) [2019-05-15 10:30:04,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:30:04,945 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:04,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:04,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:04,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:04,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:04,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:04,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,003 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:05,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:05,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:05,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:05,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_552]. (let ((.cse2 (select v_main_a_552 main_y))) (let ((.cse1 (= (store v_main_a_552 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_552 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 985 .cse2) .cse1 (= 16 .cse0))))) [2019-05-15 10:30:05,035 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:05,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:05,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:05,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:05,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:05,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,148 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:05,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:05,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:05,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:05,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_553]. (let ((.cse0 (select v_main_a_553 main_x))) (let ((.cse1 (= (store v_main_a_553 main_x (+ .cse0 1)) main_a))) (or (and (= 984 (select v_main_a_553 main_y)) (= .cse0 16) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:30:05,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:30:05,226 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:05,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:05,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:05,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:05,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:05,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,272 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:05,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:05,273 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:05,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:05,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_554]. (let ((.cse2 (select v_main_a_554 main_y))) (let ((.cse1 (select v_main_a_554 main_x)) (.cse0 (= main_a (store v_main_a_554 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 984 .cse2) (= 17 .cse1) .cse0)))) [2019-05-15 10:30:05,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:30:05,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:05,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:05,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:05,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:05,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,397 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:05,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:05,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:05,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:05,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_555]. (let ((.cse1 (select v_main_a_555 main_x))) (let ((.cse0 (= (store v_main_a_555 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 17 .cse1) .cse0 (= 983 (select v_main_a_555 main_y)))))) [2019-05-15 10:30:05,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:30:05,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:05,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:05,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:05,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:05,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:05,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,537 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:05,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:05,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:05,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:05,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_556]. (let ((.cse2 (select v_main_a_556 main_y))) (let ((.cse0 (select v_main_a_556 main_x)) (.cse1 (= (store v_main_a_556 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 18 .cse0) (= 983 .cse2) .cse1)))) [2019-05-15 10:30:05,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:05,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:05,666 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:05,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:05,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:05,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,696 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:05,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:05,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:05,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:05,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_557]. (let ((.cse1 (select v_main_a_557 main_x))) (let ((.cse0 (= (store v_main_a_557 main_x (+ .cse1 1)) main_a))) (or (and (= 982 (select v_main_a_557 main_y)) .cse0 (= 18 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:05,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:30:05,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:05,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:05,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:05,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:05,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,828 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:05,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:05,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:05,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:05,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_558]. (let ((.cse0 (select v_main_a_558 main_y))) (let ((.cse2 (= (store v_main_a_558 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_558 main_x))) (or (and (= 982 .cse0) (= 19 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:30:05,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:30:05,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:05,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:05,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:05,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:05,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:05,961 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:05,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:05,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:05,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:05,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_559]. (let ((.cse0 (select v_main_a_559 main_x))) (let ((.cse1 (= (store v_main_a_559 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 981 (select v_main_a_559 main_y)) .cse1 (= 19 .cse0))))) [2019-05-15 10:30:05,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:30:06,047 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:06,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:06,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:06,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:06,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:06,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,107 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:06,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:06,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:06,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:06,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_560]. (let ((.cse2 (select v_main_a_560 main_y))) (let ((.cse1 (= (store v_main_a_560 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_560 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 981 .cse2) .cse1 (= 20 .cse0))))) [2019-05-15 10:30:06,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:06,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:06,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:06,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:06,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:06,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,297 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:06,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:06,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:06,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:06,308 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_561]. (let ((.cse0 (select v_main_a_561 main_x))) (let ((.cse1 (= (store v_main_a_561 main_x (+ .cse0 1)) main_a))) (or (and (= 20 .cse0) .cse1 (= 980 (select v_main_a_561 main_y))) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:06,309 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:30:06,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:06,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:06,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:06,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:06,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:06,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,435 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:06,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:06,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:06,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:06,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_562]. (let ((.cse2 (select v_main_a_562 main_y))) (let ((.cse0 (= (store v_main_a_562 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_562 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 980 .cse2) .cse0 (= 21 .cse1))))) [2019-05-15 10:30:06,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:06,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:06,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:06,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:06,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:06,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,666 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:06,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:06,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:06,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:06,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_563]. (let ((.cse0 (select v_main_a_563 main_x))) (let ((.cse1 (= (store v_main_a_563 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 21 .cse0) (= 979 (select v_main_a_563 main_y)) .cse1)))) [2019-05-15 10:30:06,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:30:06,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:06,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:06,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:06,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:06,784 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:06,809 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:06,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:06,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:06,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:06,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_564]. (let ((.cse2 (select v_main_a_564 main_y))) (let ((.cse1 (= (store v_main_a_564 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_564 main_x))) (or (and (= 22 .cse0) .cse1 (= .cse2 979)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:30:06,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:30:06,896 INFO L273 TraceCheckUtils]: 0: Hoare triple {4657#true} a := a[x := 0]; {4662#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:30:06,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {4662#(= (select main_a main_x) 0)} a := a[y := 1000]; {4666#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:30:06,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {4666#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {4670#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:30:06,900 INFO L273 TraceCheckUtils]: 3: Hoare triple {4670#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {4674#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,901 INFO L273 TraceCheckUtils]: 4: Hoare triple {4674#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4678#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:30:06,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {4678#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {4682#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {4682#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4686#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:30:06,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {4686#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {4690#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {4690#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4694#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:30:06,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {4694#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {4698#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {4698#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4702#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:30:06,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {4702#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {4706#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {4706#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4710#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:30:06,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {4710#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {4714#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:30:06,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {4714#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {4718#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:30:06,913 INFO L273 TraceCheckUtils]: 15: Hoare triple {4718#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {4722#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:30:06,914 INFO L273 TraceCheckUtils]: 16: Hoare triple {4722#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {4726#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:30:06,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {4726#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {4730#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:30:06,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {4730#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {4734#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:30:06,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {4734#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {4738#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {4738#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4742#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:30:06,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {4742#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {4746#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {4746#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4750#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:30:06,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {4750#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {4754#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:30:06,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {4754#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {4758#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:30:06,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {4758#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {4762#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {4762#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4766#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:30:06,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {4766#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {4770#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {4770#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4774#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:30:06,929 INFO L273 TraceCheckUtils]: 29: Hoare triple {4774#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {4778#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:30:06,930 INFO L273 TraceCheckUtils]: 30: Hoare triple {4778#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {4782#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:30:06,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {4782#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {4786#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {4786#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4790#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:30:06,934 INFO L273 TraceCheckUtils]: 33: Hoare triple {4790#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {4794#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,935 INFO L273 TraceCheckUtils]: 34: Hoare triple {4794#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4798#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:30:06,936 INFO L273 TraceCheckUtils]: 35: Hoare triple {4798#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {4802#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:30:06,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {4802#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {4806#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:30:06,938 INFO L273 TraceCheckUtils]: 37: Hoare triple {4806#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {4810#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {4810#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4814#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:30:06,941 INFO L273 TraceCheckUtils]: 39: Hoare triple {4814#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {4818#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:30:06,942 INFO L273 TraceCheckUtils]: 40: Hoare triple {4818#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {4822#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:30:06,943 INFO L273 TraceCheckUtils]: 41: Hoare triple {4822#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {4826#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,944 INFO L273 TraceCheckUtils]: 42: Hoare triple {4826#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4830#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:30:06,945 INFO L273 TraceCheckUtils]: 43: Hoare triple {4830#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {4834#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:06,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {4834#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {4838#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:30:06,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {4838#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {4842#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:30:06,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {4842#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} assume x > y && a[x] == 1000; {4658#false} is VALID [2019-05-15 10:30:06,948 INFO L273 TraceCheckUtils]: 47: Hoare triple {4658#false} assume !(a[y] <= 0); {4658#false} is VALID [2019-05-15 10:30:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:06,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:06,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-15 10:30:06,959 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-05-15 10:30:06,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:06,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2019-05-15 10:30:07,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:07,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-05-15 10:30:07,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-15 10:30:07,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-05-15 10:30:07,020 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-05-15 10:30:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:12,694 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-15 10:30:12,694 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-05-15 10:30:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-05-15 10:30:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-05-15 10:30:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-05-15 10:30:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-05-15 10:30:12,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2019-05-15 10:30:12,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:12,783 INFO L225 Difference]: With dead ends: 51 [2019-05-15 10:30:12,783 INFO L226 Difference]: Without dead ends: 51 [2019-05-15 10:30:12,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-05-15 10:30:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-05-15 10:30:12,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-05-15 10:30:12,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:12,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:12,787 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:12,787 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:12,788 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:12,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:12,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:12,789 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:12,789 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:12,790 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:12,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:12,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:12,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:12,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-05-15 10:30:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-05-15 10:30:12,792 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-05-15 10:30:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:12,792 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-05-15 10:30:12,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-05-15 10:30:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-05-15 10:30:12,793 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:12,793 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-05-15 10:30:12,793 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1213608570, now seen corresponding path program 23 times [2019-05-15 10:30:12,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:12,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-15 10:30:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:12,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:12,936 INFO L375 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 6 treesize of output 5 [2019-05-15 10:30:12,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:12,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:12,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:12,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:12,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:12,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_565]. (= (store v_main_a_565 main_x 0) main_a) [2019-05-15 10:30:12,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:30:13,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:30:13,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,166 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:30:13,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:30:13,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:13,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_566]. (and (= main_a (store v_main_a_566 main_y 1000)) (= (select v_main_a_566 main_x) 0)) [2019-05-15 10:30:13,170 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:30:13,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:13,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:13,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:13,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:13,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,238 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:13,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:13,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:13,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:13,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_567]. (let ((.cse2 (select v_main_a_567 main_x))) (let ((.cse0 (= (store v_main_a_567 main_x (+ .cse2 1)) main_a)) (.cse1 (= 1000 (select v_main_a_567 main_y)))) (or (and (= main_y main_x) .cse0 .cse1) (and (= 0 .cse2) .cse0 .cse1)))) [2019-05-15 10:30:13,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:30:13,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:13,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:13,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:13,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,329 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:13,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:13,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:13,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:13,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_568]. (let ((.cse0 (select v_main_a_568 main_y))) (let ((.cse1 (= (store v_main_a_568 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_568 main_x))) (or (and (= 1000 .cse0) .cse1 (= 1 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:30:13,356 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:13,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:13,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:13,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:13,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,445 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:13,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:13,445 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:13,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:13,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_569]. (let ((.cse0 (select v_main_a_569 main_x))) (let ((.cse1 (= main_a (store v_main_a_569 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 999 (select v_main_a_569 main_y)) (= 1 .cse0) .cse1)))) [2019-05-15 10:30:13,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:30:13,488 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:13,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:13,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:13,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:13,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,545 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:13,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:13,546 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:13,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:13,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_570]. (let ((.cse2 (select v_main_a_570 main_y))) (let ((.cse0 (select v_main_a_570 main_x)) (.cse1 (= (store v_main_a_570 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 999) (= 2 .cse0) .cse1)))) [2019-05-15 10:30:13,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:13,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:13,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:13,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:13,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,660 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:13,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:13,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:13,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:13,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_571]. (let ((.cse1 (select v_main_a_571 main_x))) (let ((.cse0 (= (store v_main_a_571 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 2) (= 998 (select v_main_a_571 main_y))) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:30:13,674 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:30:13,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:13,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:13,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:13,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,766 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:13,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:13,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:13,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:13,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_572]. (let ((.cse1 (select v_main_a_572 main_y))) (let ((.cse0 (select v_main_a_572 main_x)) (.cse2 (= (store v_main_a_572 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 3 .cse0) (= .cse1 998) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:30:13,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:13,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:13,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:13,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:13,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,887 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:13,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:13,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:13,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:13,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_573]. (let ((.cse0 (select v_main_a_573 main_x))) (let ((.cse1 (= (store v_main_a_573 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 3) (= 997 (select v_main_a_573 main_y)) .cse1)))) [2019-05-15 10:30:13,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:30:13,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:13,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:13,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:13,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:13,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:13,988 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:13,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:13,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:14,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_574]. (let ((.cse1 (select v_main_a_574 main_y))) (let ((.cse2 (= (store v_main_a_574 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_574 main_x))) (or (and (= 4 .cse0) (= 997 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse0))))) [2019-05-15 10:30:14,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:14,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:14,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:14,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:14,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:14,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,112 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:14,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:14,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:14,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_575]. (let ((.cse1 (select v_main_a_575 main_x))) (let ((.cse0 (= (store v_main_a_575 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 4) (= 996 (select v_main_a_575 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:30:14,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:30:14,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:14,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:14,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:14,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,185 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:14,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:14,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,211 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:14,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:14,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:14,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_576]. (let ((.cse2 (select v_main_a_576 main_y))) (let ((.cse1 (select v_main_a_576 main_x)) (.cse0 (= (store v_main_a_576 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 5) (= 996 .cse2) .cse0)))) [2019-05-15 10:30:14,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:14,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:14,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:14,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:14,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:14,292 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,330 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:14,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:14,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:14,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_577]. (let ((.cse0 (select v_main_a_577 main_x))) (let ((.cse1 (= (store v_main_a_577 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 5 .cse0) (= (select v_main_a_577 main_y) 995) .cse1)))) [2019-05-15 10:30:14,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:30:14,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:14,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:14,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:14,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:14,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:14,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,573 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:14,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:14,573 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:14,618 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,618 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_578]. (let ((.cse2 (select v_main_a_578 main_y))) (let ((.cse0 (= main_a (store v_main_a_578 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_578 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 995 .cse2) (= 6 .cse1))))) [2019-05-15 10:30:14,618 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:14,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:14,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:14,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:14,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:14,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,710 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:14,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:14,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:14,722 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,722 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_579]. (let ((.cse0 (select v_main_a_579 main_x))) (let ((.cse1 (= (store v_main_a_579 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 6 .cse0) (= (select v_main_a_579 main_y) 994))))) [2019-05-15 10:30:14,722 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:30:14,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:14,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:14,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:14,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:14,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,818 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:14,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:14,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:14,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_580]. (let ((.cse1 (select v_main_a_580 main_y))) (let ((.cse0 (= main_a (store v_main_a_580 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_580 main_x))) (or (and .cse0 (= .cse1 994) (= 7 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:30:14,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:30:14,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:14,891 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:14,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:14,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:14,898 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,924 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:14,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:14,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:14,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_581]. (let ((.cse0 (select v_main_a_581 main_x))) (let ((.cse1 (= (store v_main_a_581 main_x (+ .cse0 1)) main_a))) (or (and (= 993 (select v_main_a_581 main_y)) (= .cse0 7) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:30:14,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:30:14,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:15,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:15,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:15,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,036 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:15,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:15,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:15,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_582]. (let ((.cse1 (select v_main_a_582 main_y))) (let ((.cse0 (select v_main_a_582 main_x)) (.cse2 (= (store v_main_a_582 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 8 .cse0) (= .cse1 993) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:30:15,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:15,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:15,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:15,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:15,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,188 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:15,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:15,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:15,201 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,201 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_583]. (let ((.cse0 (select v_main_a_583 main_x))) (let ((.cse1 (= (store v_main_a_583 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 8) (= 992 (select v_main_a_583 main_y)) .cse1)))) [2019-05-15 10:30:15,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:30:15,253 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:15,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:15,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:15,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:15,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,304 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:15,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:15,304 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:15,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_584]. (let ((.cse2 (select v_main_a_584 main_y))) (let ((.cse0 (= (store v_main_a_584 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_584 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 992) (= 9 .cse1))))) [2019-05-15 10:30:15,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:30:15,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:15,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:15,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:15,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,441 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:15,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:15,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:15,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_585]. (let ((.cse1 (select v_main_a_585 main_x))) (let ((.cse0 (= (store v_main_a_585 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= 991 (select v_main_a_585 main_y)) (= .cse1 9))))) [2019-05-15 10:30:15,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:30:15,539 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:15,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:15,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:15,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:15,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,586 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:15,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:15,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:15,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_586]. (let ((.cse2 (select v_main_a_586 main_y))) (let ((.cse0 (select v_main_a_586 main_x)) (.cse1 (= (store v_main_a_586 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 10) .cse1 (= 991 .cse2))))) [2019-05-15 10:30:15,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:15,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:15,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:15,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:15,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,721 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:15,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:15,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:15,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_587]. (let ((.cse1 (select v_main_a_587 main_x))) (let ((.cse0 (= main_a (store v_main_a_587 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= 990 (select v_main_a_587 main_y)) (= .cse1 10))))) [2019-05-15 10:30:15,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:30:15,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:15,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:15,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:15,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:15,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,837 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:15,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:15,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:15,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_588]. (let ((.cse2 (select v_main_a_588 main_y))) (let ((.cse1 (= (store v_main_a_588 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_588 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 990) .cse1 (= 11 .cse0))))) [2019-05-15 10:30:15,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:30:15,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:15,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:15,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:15,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,964 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:15,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:15,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:15,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_589]. (let ((.cse0 (select v_main_a_589 main_x))) (let ((.cse1 (= (store v_main_a_589 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 989 (select v_main_a_589 main_y)) (= .cse0 11) .cse1)))) [2019-05-15 10:30:15,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:30:16,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:16,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:16,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:16,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,052 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:16,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,079 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:16,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:16,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:16,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_590]. (let ((.cse2 (select v_main_a_590 main_y))) (let ((.cse0 (= main_a (store v_main_a_590 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_590 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 12 .cse1) (= 989 .cse2))))) [2019-05-15 10:30:16,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:16,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:16,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:16,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:16,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,231 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:16,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:16,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:16,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_591]. (let ((.cse0 (select v_main_a_591 main_x))) (let ((.cse1 (= (store v_main_a_591 main_x (+ .cse0 1)) main_a))) (or (and (= 988 (select v_main_a_591 main_y)) (= 12 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:16,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:30:16,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:16,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:16,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:16,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,373 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:16,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:16,374 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:16,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_592]. (let ((.cse2 (select v_main_a_592 main_y))) (let ((.cse0 (= (store v_main_a_592 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_592 main_x))) (or (and .cse0 (= 13 .cse1) (= 988 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:30:16,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:16,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:16,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:16,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,550 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:16,552 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,578 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:16,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:16,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:16,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_593]. (let ((.cse1 (select v_main_a_593 main_x))) (let ((.cse0 (= main_a (store v_main_a_593 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 13 .cse1) .cse0 (= 987 (select v_main_a_593 main_y)))))) [2019-05-15 10:30:16,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:30:16,650 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:16,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:16,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:16,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:16,675 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,710 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:16,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:16,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:16,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_594]. (let ((.cse2 (select v_main_a_594 main_y))) (let ((.cse0 (select v_main_a_594 main_x)) (.cse1 (= (store v_main_a_594 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 987 .cse2) (= .cse0 14) .cse1)))) [2019-05-15 10:30:16,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:30:16,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:16,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:16,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:16,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,835 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:16,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:16,836 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:16,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,847 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_595]. (let ((.cse0 (select v_main_a_595 main_x))) (let ((.cse1 (= (store v_main_a_595 main_x (+ .cse0 1)) main_a))) (or (and (= 14 .cse0) (= 986 (select v_main_a_595 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:16,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:30:16,910 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:16,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:16,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:16,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,932 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:16,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,959 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:16,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:16,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:17,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_596]. (let ((.cse2 (select v_main_a_596 main_y))) (let ((.cse0 (= main_a (store v_main_a_596 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_596 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 986 .cse2) .cse0 (= 15 .cse1))))) [2019-05-15 10:30:17,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:17,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:17,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:17,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:17,111 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,135 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:17,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:17,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:17,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_597]. (let ((.cse1 (select v_main_a_597 main_x))) (let ((.cse0 (= (store v_main_a_597 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 985 (select v_main_a_597 main_y)) (= 15 .cse1))))) [2019-05-15 10:30:17,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:30:17,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:17,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:17,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:17,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:17,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,274 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:17,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:17,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:17,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,326 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_598]. (let ((.cse2 (select v_main_a_598 main_y))) (let ((.cse0 (= (store v_main_a_598 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_598 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 16 .cse1) (= 985 .cse2))))) [2019-05-15 10:30:17,327 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:17,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:17,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:17,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:17,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,446 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:17,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:17,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:17,456 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,457 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_599]. (let ((.cse1 (select v_main_a_599 main_x))) (let ((.cse0 (= (store v_main_a_599 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 16 .cse1) (= 984 (select v_main_a_599 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:17,457 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:30:17,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:17,542 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:17,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:17,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,575 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:17,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:17,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:17,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_600]. (let ((.cse1 (select v_main_a_600 main_y))) (let ((.cse0 (select v_main_a_600 main_x)) (.cse2 (= (store v_main_a_600 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 17 .cse0) (= .cse1 984) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:30:17,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:30:17,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:17,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:17,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:17,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,705 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:17,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:17,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:17,718 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_601]. (let ((.cse1 (select v_main_a_601 main_x))) (let ((.cse0 (= (store v_main_a_601 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 983 (select v_main_a_601 main_y)) (= 17 .cse1) .cse0)))) [2019-05-15 10:30:17,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:30:17,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:17,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:17,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:17,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,854 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:17,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:17,855 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:17,889 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_602]. (let ((.cse1 (select v_main_a_602 main_y))) (let ((.cse2 (= main_a (store v_main_a_602 main_y (+ .cse1 (- 1))))) (.cse0 (select v_main_a_602 main_x))) (or (and (= .cse0 18) (= 983 .cse1) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:30:17,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:17,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:17,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:17,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:17,990 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,015 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:18,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:18,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:18,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_603]. (let ((.cse0 (select v_main_a_603 main_x))) (let ((.cse1 (= main_a (store v_main_a_603 main_x (+ .cse0 1))))) (or (and (= 982 (select v_main_a_603 main_y)) (= 18 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:18,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:30:18,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:18,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:18,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:18,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,153 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:18,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:18,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:18,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_604]. (let ((.cse2 (select v_main_a_604 main_y))) (let ((.cse1 (= (store v_main_a_604 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_604 main_x))) (or (and (= 19 .cse0) .cse1 (= 982 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:30:18,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:30:18,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:18,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:18,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:18,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,291 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:18,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:18,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:18,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_605]. (let ((.cse0 (select v_main_a_605 main_x))) (let ((.cse1 (= (store v_main_a_605 main_x (+ .cse0 1)) main_a))) (or (and (= 19 .cse0) (= (select v_main_a_605 main_y) 981) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:18,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:30:18,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:18,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:18,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:18,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:18,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,441 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:18,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:18,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:18,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_606]. (let ((.cse2 (select v_main_a_606 main_y))) (let ((.cse1 (= (store v_main_a_606 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_606 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 981 .cse2) .cse1 (= .cse0 20))))) [2019-05-15 10:30:18,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:18,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:18,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:18,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:18,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,643 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:18,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:18,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:18,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,652 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_607]. (let ((.cse1 (select v_main_a_607 main_x))) (let ((.cse0 (= main_a (store v_main_a_607 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 20) (= (select v_main_a_607 main_y) 980)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:30:18,652 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:30:18,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:18,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:18,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:18,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:18,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,780 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:18,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:18,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:18,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_608]. (let ((.cse2 (select v_main_a_608 main_y))) (let ((.cse0 (= (store v_main_a_608 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_608 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 21 .cse1) (= .cse2 980))))) [2019-05-15 10:30:18,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:18,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:18,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:18,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:18,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,965 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:18,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:18,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:18,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_609]. (let ((.cse1 (select v_main_a_609 main_x))) (let ((.cse0 (= (store v_main_a_609 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_609 main_y) 979) (= .cse1 21) .cse0)))) [2019-05-15 10:30:18,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:30:19,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:19,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:19,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:19,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:19,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:19,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:19,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:19,110 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:19,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:19,110 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:19,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:19,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_610]. (let ((.cse2 (select v_main_a_610 main_y))) (let ((.cse1 (select v_main_a_610 main_x)) (.cse0 (= main_a (store v_main_a_610 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 22 .cse1) .cse0 (= 979 .cse2))))) [2019-05-15 10:30:19,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:30:19,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:19,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:19,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:19,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:19,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:19,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:19,243 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:19,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:19,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:19,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:19,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_611]. (let ((.cse1 (select v_main_a_611 main_x))) (let ((.cse0 (= (store v_main_a_611 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= 978 (select v_main_a_611 main_y)) (= .cse1 22))))) [2019-05-15 10:30:19,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:30:19,333 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:19,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:19,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:19,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:19,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:19,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:19,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:19,392 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:19,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:19,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:19,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:19,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_612]. (let ((.cse2 (select v_main_a_612 main_y))) (let ((.cse1 (= (store v_main_a_612 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_612 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 23 .cse0) (= .cse2 978))))) [2019-05-15 10:30:19,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:19,629 INFO L273 TraceCheckUtils]: 0: Hoare triple {5052#true} a := a[x := 0]; {5057#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:30:19,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#(= (select main_a main_x) 0)} a := a[y := 1000]; {5061#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:30:19,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {5061#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {5065#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:30:19,632 INFO L273 TraceCheckUtils]: 3: Hoare triple {5065#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {5069#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,633 INFO L273 TraceCheckUtils]: 4: Hoare triple {5069#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5073#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:30:19,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {5073#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {5077#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {5077#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5081#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:30:19,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {5081#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {5085#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {5085#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5089#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:30:19,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {5089#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {5093#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {5093#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5097#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:30:19,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {5097#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {5101#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {5101#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5105#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:30:19,644 INFO L273 TraceCheckUtils]: 13: Hoare triple {5105#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {5109#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:30:19,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {5109#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {5113#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:30:19,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {5113#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {5117#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:30:19,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {5117#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {5121#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:30:19,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {5121#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {5125#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:30:19,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {5125#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {5129#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:30:19,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {5129#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {5133#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {5133#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5137#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:30:19,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {5137#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {5141#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {5141#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5145#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:30:19,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {5145#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {5149#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:30:19,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {5149#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {5153#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:30:19,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {5153#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {5157#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {5157#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5161#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:30:19,660 INFO L273 TraceCheckUtils]: 27: Hoare triple {5161#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {5165#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {5165#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5169#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:30:19,662 INFO L273 TraceCheckUtils]: 29: Hoare triple {5169#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {5173#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:30:19,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {5173#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {5177#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:30:19,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {5177#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {5181#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {5181#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5185#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:30:19,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {5185#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {5189#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {5189#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5193#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:30:19,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {5193#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {5197#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:30:19,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {5197#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {5201#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:30:19,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {5201#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {5205#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,672 INFO L273 TraceCheckUtils]: 38: Hoare triple {5205#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5209#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:30:19,674 INFO L273 TraceCheckUtils]: 39: Hoare triple {5209#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {5213#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:30:19,675 INFO L273 TraceCheckUtils]: 40: Hoare triple {5213#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {5217#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:30:19,676 INFO L273 TraceCheckUtils]: 41: Hoare triple {5217#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {5221#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,677 INFO L273 TraceCheckUtils]: 42: Hoare triple {5221#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5225#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:30:19,678 INFO L273 TraceCheckUtils]: 43: Hoare triple {5225#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {5229#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,679 INFO L273 TraceCheckUtils]: 44: Hoare triple {5229#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5233#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:30:19,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {5233#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {5237#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:30:19,682 INFO L273 TraceCheckUtils]: 46: Hoare triple {5237#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {5241#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:30:19,683 INFO L273 TraceCheckUtils]: 47: Hoare triple {5241#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {5245#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:19,684 INFO L273 TraceCheckUtils]: 48: Hoare triple {5245#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {5053#false} is VALID [2019-05-15 10:30:19,684 INFO L273 TraceCheckUtils]: 49: Hoare triple {5053#false} assume !(a[y] <= 0); {5053#false} is VALID [2019-05-15 10:30:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:19,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:19,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-15 10:30:19,695 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-05-15 10:30:19,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:19,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2019-05-15 10:30:19,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:19,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-05-15 10:30:19,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-15 10:30:19,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-05-15 10:30:19,764 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-05-15 10:30:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:25,952 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:25,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-15 10:30:25,953 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-05-15 10:30:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-05-15 10:30:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-05-15 10:30:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-05-15 10:30:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-05-15 10:30:25,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2019-05-15 10:30:26,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:26,368 INFO L225 Difference]: With dead ends: 53 [2019-05-15 10:30:26,368 INFO L226 Difference]: Without dead ends: 53 [2019-05-15 10:30:26,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-05-15 10:30:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-05-15 10:30:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-05-15 10:30:26,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:26,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:26,372 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:26,372 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:26,373 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:26,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:26,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:26,374 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:26,374 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:26,375 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:26,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:26,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:26,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:26,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-05-15 10:30:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-05-15 10:30:26,377 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-05-15 10:30:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:26,378 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-05-15 10:30:26,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-05-15 10:30:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-05-15 10:30:26,378 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:26,379 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-05-15 10:30:26,379 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:26,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:26,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1953422181, now seen corresponding path program 24 times [2019-05-15 10:30:26,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:26,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-15 10:30:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:26,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:26,546 INFO L375 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 6 treesize of output 5 [2019-05-15 10:30:26,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:26,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:26,595 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:26,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_613]. (= (store v_main_a_613 main_x 0) main_a) [2019-05-15 10:30:26,596 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:30:26,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:26,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:30:26,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,730 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:30:26,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:30:26,733 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:26,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_614]. (and (= 0 (select v_main_a_614 main_x)) (= (store v_main_a_614 main_y 1000) main_a)) [2019-05-15 10:30:26,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:30:26,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:26,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:26,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:26,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:26,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:26,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,804 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:26,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:26,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:26,812 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:26,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_615]. (let ((.cse2 (select v_main_a_615 main_x))) (let ((.cse0 (= (store v_main_a_615 main_x (+ .cse2 1)) main_a)) (.cse1 (= 1000 (select v_main_a_615 main_y)))) (or (and .cse0 .cse1 (= main_y main_x)) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:30:26,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:30:26,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:26,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:26,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:26,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:26,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:26,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,888 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:26,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:26,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:26,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:26,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_616]. (let ((.cse2 (select v_main_a_616 main_y))) (let ((.cse1 (select v_main_a_616 main_x)) (.cse0 (= (store v_main_a_616 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 1) .cse0 (= 1000 .cse2))))) [2019-05-15 10:30:26,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:26,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:26,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:26,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:26,980 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:26,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:26,981 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,015 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_617]. (let ((.cse0 (select v_main_a_617 main_x))) (let ((.cse1 (= (store v_main_a_617 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 1) .cse1 (= (select v_main_a_617 main_y) 999))))) [2019-05-15 10:30:27,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:30:27,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:27,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:27,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:27,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:27,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:27,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,118 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_618]. (let ((.cse2 (select v_main_a_618 main_y))) (let ((.cse0 (select v_main_a_618 main_x)) (.cse1 (= main_a (store v_main_a_618 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 2 .cse0) (= 999 .cse2) .cse1)))) [2019-05-15 10:30:27,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:27,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:27,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:27,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:27,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:27,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,252 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_619]. (let ((.cse0 (select v_main_a_619 main_x))) (let ((.cse1 (= (store v_main_a_619 main_x (+ .cse0 1)) main_a))) (or (and (= 998 (select v_main_a_619 main_y)) (= .cse0 2) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:30:27,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:30:27,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:27,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:27,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:27,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:27,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,362 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,362 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_620]. (let ((.cse1 (select v_main_a_620 main_y))) (let ((.cse0 (select v_main_a_620 main_x)) (.cse2 (= (store v_main_a_620 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 3) (= 998 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:30:27,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:27,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:27,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:27,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:27,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:27,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,484 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,484 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_621]. (let ((.cse1 (select v_main_a_621 main_x))) (let ((.cse0 (= (store v_main_a_621 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 3 .cse1) (= 997 (select v_main_a_621 main_y)) .cse0)))) [2019-05-15 10:30:27,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:30:27,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:27,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:27,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:27,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:27,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,580 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_622]. (let ((.cse0 (select v_main_a_622 main_y))) (let ((.cse2 (= (store v_main_a_622 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_622 main_x))) (or (and (= .cse0 997) (= .cse1 4) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:30:27,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:27,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:27,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:27,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:27,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:27,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,718 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,728 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_623]. (let ((.cse0 (select v_main_a_623 main_x))) (let ((.cse1 (= (store v_main_a_623 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 996 (select v_main_a_623 main_y)) (= .cse0 4) .cse1)))) [2019-05-15 10:30:27,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:30:27,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:27,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:27,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:27,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,789 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:27,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:27,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,816 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,847 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_624]. (let ((.cse2 (select v_main_a_624 main_y))) (let ((.cse1 (select v_main_a_624 main_x)) (.cse0 (= (store v_main_a_624 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 5) .cse0 (= 996 .cse2))))) [2019-05-15 10:30:27,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:27,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:27,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:27,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,906 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:27,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:27,908 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:27,933 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:27,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:27,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:27,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:27,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_625]. (let ((.cse1 (select v_main_a_625 main_x))) (let ((.cse0 (= (store v_main_a_625 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_625 main_y) 995) (= .cse1 5))))) [2019-05-15 10:30:27,944 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:30:27,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,003 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:28,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:28,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,046 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:28,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:28,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:28,106 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_626]. (let ((.cse1 (select v_main_a_626 main_y))) (let ((.cse0 (select v_main_a_626 main_x)) (.cse2 (= (store v_main_a_626 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 6 .cse0) (= .cse1 995) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:30:28,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:28,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:28,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,170 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:28,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,196 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:28,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:28,196 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:28,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_627]. (let ((.cse0 (select v_main_a_627 main_x))) (let ((.cse1 (= main_a (store v_main_a_627 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 994 (select v_main_a_627 main_y)) .cse1 (= 6 .cse0))))) [2019-05-15 10:30:28,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:30:28,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:28,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:28,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:28,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,298 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:28,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:28,299 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:28,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,317 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_628]. (let ((.cse2 (select v_main_a_628 main_y))) (let ((.cse0 (select v_main_a_628 main_x)) (.cse1 (= (store v_main_a_628 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 7 .cse0) .cse1 (= 994 .cse2))))) [2019-05-15 10:30:28,317 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:30:28,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:28,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:28,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,407 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:28,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:28,408 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:28,419 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_629]. (let ((.cse1 (select v_main_a_629 main_x))) (let ((.cse0 (= (store v_main_a_629 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 993 (select v_main_a_629 main_y)) (= 7 .cse1))))) [2019-05-15 10:30:28,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:30:28,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:28,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:28,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,514 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:28,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:28,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:28,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_630]. (let ((.cse0 (select v_main_a_630 main_y))) (let ((.cse2 (= (store v_main_a_630 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_630 main_x))) (or (and (= .cse0 993) (= .cse1 8) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:30:28,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:28,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:28,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:28,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,644 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:28,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:28,644 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:28,655 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_631]. (let ((.cse0 (select v_main_a_631 main_x))) (let ((.cse1 (= (store v_main_a_631 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_631 main_y) 992) .cse1 (= .cse0 8))))) [2019-05-15 10:30:28,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:30:28,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:28,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:28,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,795 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:28,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:28,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:28,806 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,806 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_632]. (let ((.cse2 (select v_main_a_632 main_y))) (let ((.cse1 (= (store v_main_a_632 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_632 main_x))) (or (and (= 9 .cse0) .cse1 (= 992 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:30:28,806 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:30:28,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:28,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:28,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,920 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:28,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:28,921 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:28,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_633]. (let ((.cse1 (select v_main_a_633 main_x))) (let ((.cse0 (= (store v_main_a_633 main_x (+ .cse1 1)) main_a))) (or (and (= 991 (select v_main_a_633 main_y)) .cse0 (= 9 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:28,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:30:28,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:28,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:28,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:28,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,007 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:29,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,035 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:29,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:29,035 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:29,070 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,070 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_634]. (let ((.cse2 (select v_main_a_634 main_y))) (let ((.cse0 (select v_main_a_634 main_x)) (.cse1 (= (store v_main_a_634 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 10) (= .cse2 991) .cse1)))) [2019-05-15 10:30:29,070 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:29,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:29,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:29,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:29,198 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,223 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:29,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:29,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:29,234 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,234 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_635]. (let ((.cse0 (select v_main_a_635 main_x))) (let ((.cse1 (= (store v_main_a_635 main_x (+ .cse0 1)) main_a))) (or (and (= 10 .cse0) .cse1 (= 990 (select v_main_a_635 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:30:29,234 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:30:29,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:29,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:29,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:29,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,342 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:29,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:29,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:29,352 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_636]. (let ((.cse2 (select v_main_a_636 main_y))) (let ((.cse1 (select v_main_a_636 main_x)) (.cse0 (= (store v_main_a_636 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 11 .cse1) (= 990 .cse2)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:30:29,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:30:29,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:29,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:29,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:29,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,460 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:29,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:29,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:29,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_637]. (let ((.cse0 (select v_main_a_637 main_x))) (let ((.cse1 (= main_a (store v_main_a_637 main_x (+ .cse0 1))))) (or (and (= 989 (select v_main_a_637 main_y)) (= 11 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:29,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:30:29,533 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:29,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:29,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:29,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:29,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,584 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:29,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:29,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:29,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_638]. (let ((.cse2 (select v_main_a_638 main_y))) (let ((.cse1 (select v_main_a_638 main_x)) (.cse0 (= (store v_main_a_638 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 989 .cse2) (= .cse1 12) .cse0)))) [2019-05-15 10:30:29,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:29,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:29,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:29,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:29,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,857 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:29,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:29,857 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:29,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_639]. (let ((.cse0 (select v_main_a_639 main_x))) (let ((.cse1 (= (store v_main_a_639 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 988 (select v_main_a_639 main_y)) .cse1 (= .cse0 12))))) [2019-05-15 10:30:29,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:30:30,010 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:30,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:30,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:30,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:30,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,102 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:30,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:30,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:30,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_640]. (let ((.cse2 (select v_main_a_640 main_y))) (let ((.cse0 (= main_a (store v_main_a_640 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_640 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 988) .cse0 (= .cse1 13))))) [2019-05-15 10:30:30,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:30,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:30,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:30,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:30,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,655 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:30,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:30,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:30,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_641]. (let ((.cse1 (select v_main_a_641 main_x))) (let ((.cse0 (= main_a (store v_main_a_641 main_x (+ .cse1 1))))) (or (and (= 987 (select v_main_a_641 main_y)) .cse0 (= 13 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:30,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:30:30,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:30,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:30,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:30,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,802 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:30,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:30,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:30,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_642]. (let ((.cse1 (select v_main_a_642 main_y))) (let ((.cse2 (= (store v_main_a_642 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_642 main_x))) (or (and (= 14 .cse0) (= 987 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse0))))) [2019-05-15 10:30:30,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:30:30,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:30,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:30,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:30,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,945 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:30,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:30,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:30,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_643]. (let ((.cse0 (select v_main_a_643 main_x))) (let ((.cse1 (= (store v_main_a_643 main_x (+ .cse0 1)) main_a))) (or (and (= 14 .cse0) (= (select v_main_a_643 main_y) 986) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:30,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:30:31,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:31,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:31,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:31,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,083 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:31,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:31,083 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:31,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_644]. (let ((.cse0 (select v_main_a_644 main_y))) (let ((.cse1 (= (store v_main_a_644 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_644 main_x))) (or (and (= 986 .cse0) .cse1 (= 15 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:30:31,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:31,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:31,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:31,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:31,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,245 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:31,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:31,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:31,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_645]. (let ((.cse1 (select v_main_a_645 main_x))) (let ((.cse0 (= main_a (store v_main_a_645 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 985 (select v_main_a_645 main_y)) (= 15 .cse1))))) [2019-05-15 10:30:31,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:30:31,329 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:31,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:31,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:31,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,353 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:31,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,392 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:31,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:31,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:31,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_646]. (let ((.cse2 (select v_main_a_646 main_y))) (let ((.cse0 (select v_main_a_646 main_x)) (.cse1 (= main_a (store v_main_a_646 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 16) (= 985 .cse2) .cse1)))) [2019-05-15 10:30:31,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:31,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:31,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:31,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:31,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,649 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:31,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:31,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:31,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_647]. (let ((.cse1 (select v_main_a_647 main_x))) (let ((.cse0 (= (store v_main_a_647 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 984 (select v_main_a_647 main_y)) .cse0 (= 16 .cse1))))) [2019-05-15 10:30:31,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:30:31,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:31,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:31,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:31,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:31,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,797 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:31,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:31,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:31,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_648]. (let ((.cse2 (select v_main_a_648 main_y))) (let ((.cse0 (select v_main_a_648 main_x)) (.cse1 (= (store v_main_a_648 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 17 .cse0) .cse1 (= 984 .cse2))))) [2019-05-15 10:30:31,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:30:31,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:31,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:31,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:31,898 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,923 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:31,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:31,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:31,938 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_649]. (let ((.cse0 (select v_main_a_649 main_x))) (let ((.cse1 (= (store v_main_a_649 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 17) (= 983 (select v_main_a_649 main_y)) .cse1)))) [2019-05-15 10:30:31,938 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:30:32,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:32,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:32,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:32,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:32,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,066 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:32,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:32,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:32,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_650]. (let ((.cse2 (select v_main_a_650 main_y))) (let ((.cse0 (= (store v_main_a_650 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_650 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 18) (= 983 .cse2))))) [2019-05-15 10:30:32,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:32,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:32,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:32,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:32,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,236 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:32,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:32,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:32,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_651]. (let ((.cse1 (select v_main_a_651 main_x))) (let ((.cse0 (= (store v_main_a_651 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 18) (= 982 (select v_main_a_651 main_y)))))) [2019-05-15 10:30:32,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:30:32,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:32,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:32,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:32,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,377 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:32,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:32,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:32,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_652]. (let ((.cse0 (select v_main_a_652 main_y))) (let ((.cse2 (select v_main_a_652 main_x)) (.cse1 (= (store v_main_a_652 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 982 .cse0) .cse1 (= .cse2 19)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:30:32,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:30:32,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:32,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:32,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:32,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,509 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:32,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:32,510 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:32,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_653]. (let ((.cse1 (select v_main_a_653 main_x))) (let ((.cse0 (= main_a (store v_main_a_653 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_653 main_y) 981) .cse0 (= 19 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:30:32,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:30:32,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:32,614 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:32,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:32,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,658 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:32,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:32,658 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:32,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,712 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_654]. (let ((.cse0 (select v_main_a_654 main_y))) (let ((.cse2 (select v_main_a_654 main_x)) (.cse1 (= (store v_main_a_654 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 981) .cse1 (= 20 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:30:32,712 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:32,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:32,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:32,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:32,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,838 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:32,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:32,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:32,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_655]. (let ((.cse1 (select v_main_a_655 main_x))) (let ((.cse0 (= (store v_main_a_655 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 20 .cse1) (= 980 (select v_main_a_655 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:32,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:30:32,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:32,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:32,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:32,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,976 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:32,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:32,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:33,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_656]. (let ((.cse1 (select v_main_a_656 main_y))) (let ((.cse0 (select v_main_a_656 main_x)) (.cse2 (= (store v_main_a_656 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 21 .cse0) (= 980 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:30:33,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:33,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:33,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:33,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:33,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,146 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:33,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:33,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:33,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_657]. (let ((.cse1 (select v_main_a_657 main_x))) (let ((.cse0 (= (store v_main_a_657 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 21 .cse1) (= (select v_main_a_657 main_y) 979)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:33,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:30:33,237 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:33,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:33,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:33,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:33,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,298 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:33,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:33,299 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:33,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_658]. (let ((.cse2 (select v_main_a_658 main_y))) (let ((.cse0 (= (store v_main_a_658 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_658 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= 979 .cse2) (= .cse1 22))))) [2019-05-15 10:30:33,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:30:33,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:33,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:33,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:33,417 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,440 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:33,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:33,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:33,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_659]. (let ((.cse1 (select v_main_a_659 main_x))) (let ((.cse0 (= (store v_main_a_659 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 22) (= 978 (select v_main_a_659 main_y)))))) [2019-05-15 10:30:33,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:30:33,534 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:33,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:33,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:33,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:33,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,592 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:33,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:33,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:33,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_660]. (let ((.cse2 (select v_main_a_660 main_y))) (let ((.cse0 (= (store v_main_a_660 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_660 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 978) (= 23 .cse1))))) [2019-05-15 10:30:33,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:33,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:33,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:33,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:33,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,808 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:33,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:33,809 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:33,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_661]. (let ((.cse1 (select v_main_a_661 main_x))) (let ((.cse0 (= (store v_main_a_661 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 23 .cse1) (= (select v_main_a_661 main_y) 977)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:33,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:30:33,900 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:33,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:33,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:33,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:33,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,950 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:33,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:33,950 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:34,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:34,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_662]. (let ((.cse2 (select v_main_a_662 main_y))) (let ((.cse0 (= (store v_main_a_662 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_662 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 24 .cse1) (= 977 .cse2))))) [2019-05-15 10:30:34,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:34,086 INFO L273 TraceCheckUtils]: 0: Hoare triple {5463#true} a := a[x := 0]; {5468#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:30:34,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {5468#(= (select main_a main_x) 0)} a := a[y := 1000]; {5472#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:30:34,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {5472#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {5476#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:30:34,090 INFO L273 TraceCheckUtils]: 3: Hoare triple {5476#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {5480#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,091 INFO L273 TraceCheckUtils]: 4: Hoare triple {5480#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5484#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:30:34,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {5484#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {5488#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {5488#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5492#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:30:34,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {5492#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {5496#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {5496#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5500#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:30:34,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {5500#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {5504#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {5504#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5508#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:30:34,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {5508#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {5512#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {5512#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5516#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:30:34,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {5516#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {5520#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:30:34,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {5520#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {5524#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:30:34,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {5524#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {5528#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:30:34,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {5528#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {5532#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:30:34,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {5532#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {5536#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:30:34,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {5536#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {5540#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:30:34,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {5540#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {5544#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {5544#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5548#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:30:34,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {5548#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {5552#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {5552#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5556#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:30:34,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {5556#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {5560#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:30:34,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {5560#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {5564#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:30:34,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {5564#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {5568#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {5568#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5572#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:30:34,138 INFO L273 TraceCheckUtils]: 27: Hoare triple {5572#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {5576#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {5576#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5580#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:30:34,140 INFO L273 TraceCheckUtils]: 29: Hoare triple {5580#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {5584#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:30:34,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {5584#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {5588#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:30:34,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {5588#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {5592#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {5592#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5596#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:30:34,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {5596#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {5600#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {5600#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5604#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:30:34,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {5604#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {5608#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:30:34,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {5608#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {5612#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:30:34,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {5612#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {5616#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {5616#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5620#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:30:34,152 INFO L273 TraceCheckUtils]: 39: Hoare triple {5620#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {5624#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:30:34,153 INFO L273 TraceCheckUtils]: 40: Hoare triple {5624#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {5628#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:30:34,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {5628#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {5632#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,155 INFO L273 TraceCheckUtils]: 42: Hoare triple {5632#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5636#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:30:34,156 INFO L273 TraceCheckUtils]: 43: Hoare triple {5636#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {5640#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {5640#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5644#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:30:34,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {5644#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {5648#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:30:34,160 INFO L273 TraceCheckUtils]: 46: Hoare triple {5648#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {5652#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:30:34,161 INFO L273 TraceCheckUtils]: 47: Hoare triple {5652#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {5656#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,162 INFO L273 TraceCheckUtils]: 48: Hoare triple {5656#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5660#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:30:34,163 INFO L273 TraceCheckUtils]: 49: Hoare triple {5660#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {5664#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:34,164 INFO L273 TraceCheckUtils]: 50: Hoare triple {5664#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {5464#false} is VALID [2019-05-15 10:30:34,164 INFO L273 TraceCheckUtils]: 51: Hoare triple {5464#false} assume !(a[y] <= 0); {5464#false} is VALID [2019-05-15 10:30:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:34,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:34,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-15 10:30:34,176 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-05-15 10:30:34,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:34,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2019-05-15 10:30:34,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:34,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-05-15 10:30:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-15 10:30:34,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-05-15 10:30:34,250 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-05-15 10:30:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:41,203 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:30:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-15 10:30:41,203 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-05-15 10:30:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-05-15 10:30:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-05-15 10:30:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-05-15 10:30:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-05-15 10:30:41,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2019-05-15 10:30:41,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:41,517 INFO L225 Difference]: With dead ends: 55 [2019-05-15 10:30:41,517 INFO L226 Difference]: Without dead ends: 55 [2019-05-15 10:30:41,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-05-15 10:30:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-05-15 10:30:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-05-15 10:30:41,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:41,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:41,520 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:41,520 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:41,522 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:30:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:30:41,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:41,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:41,522 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:41,522 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:41,523 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:30:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:30:41,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:41,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:41,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:41,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-05-15 10:30:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-05-15 10:30:41,526 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-05-15 10:30:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:41,526 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-05-15 10:30:41,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-05-15 10:30:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:30:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-05-15 10:30:41,527 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:41,527 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-05-15 10:30:41,527 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -338161028, now seen corresponding path program 25 times [2019-05-15 10:30:41,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:41,580 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-15 10:30:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:41,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:41,674 INFO L375 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 6 treesize of output 5 [2019-05-15 10:30:41,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:41,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_663]. (= (store v_main_a_663 main_x 0) main_a) [2019-05-15 10:30:41,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:30:41,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:30:41,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,716 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:30:41,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:30:41,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_664]. (and (= (store v_main_a_664 main_y 1000) main_a) (= (select v_main_a_664 main_x) 0)) [2019-05-15 10:30:41,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:30:41,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:41,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:41,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:41,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,791 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:41,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:41,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:41,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,799 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_665]. (let ((.cse2 (select v_main_a_665 main_x))) (let ((.cse0 (= 1000 (select v_main_a_665 main_y))) (.cse1 (= (store v_main_a_665 main_x (+ .cse2 1)) main_a))) (or (and .cse0 .cse1 (= 0 .cse2)) (and (= main_y main_x) .cse0 .cse1)))) [2019-05-15 10:30:41,799 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:30:41,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:41,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:41,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:41,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,929 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:41,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:41,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:41,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_666]. (let ((.cse0 (select v_main_a_666 main_y))) (let ((.cse1 (= (store v_main_a_666 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_666 main_x))) (or (and (= 1000 .cse0) .cse1 (= .cse2 1)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:30:41,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:42,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:42,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,067 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_667]. (let ((.cse1 (select v_main_a_667 main_x))) (let ((.cse0 (= main_a (store v_main_a_667 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 1) (= 999 (select v_main_a_667 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:30:42,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:30:42,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:42,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,177 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_668]. (let ((.cse2 (select v_main_a_668 main_y))) (let ((.cse0 (= (store v_main_a_668 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_668 main_x))) (or (and .cse0 (= .cse1 2) (= 999 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:30:42,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:42,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:42,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,286 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,286 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,297 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,297 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_669]. (let ((.cse1 (select v_main_a_669 main_x))) (let ((.cse0 (= (store v_main_a_669 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_669 main_y) 998) (= .cse1 2)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:30:42,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:30:42,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:42,358 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,383 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_670]. (let ((.cse2 (select v_main_a_670 main_y))) (let ((.cse0 (select v_main_a_670 main_x)) (.cse1 (= main_a (store v_main_a_670 main_y (+ .cse2 (- 1)))))) (or (and (= .cse0 3) .cse1 (= 998 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:30:42,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:42,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:42,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,508 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,509 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_671]. (let ((.cse1 (select v_main_a_671 main_x))) (let ((.cse0 (= (store v_main_a_671 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 3 .cse1) (= 997 (select v_main_a_671 main_y))) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:30:42,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:30:42,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,576 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:42,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,607 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_672]. (let ((.cse1 (select v_main_a_672 main_y))) (let ((.cse0 (= main_a (store v_main_a_672 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_672 main_x))) (or (and .cse0 (= 997 .cse1) (= 4 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:30:42,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:42,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:42,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,707 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,741 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,741 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_673]. (let ((.cse1 (select v_main_a_673 main_x))) (let ((.cse0 (= (store v_main_a_673 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 996 (select v_main_a_673 main_y)) (= 4 .cse1) .cse0)))) [2019-05-15 10:30:42,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:30:42,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:42,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:42,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,839 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,865 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_674]. (let ((.cse2 (select v_main_a_674 main_y))) (let ((.cse0 (= main_a (store v_main_a_674 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_674 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 996) (= .cse1 5))))) [2019-05-15 10:30:42,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:42,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:42,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:42,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:42,933 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,957 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:42,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:42,958 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:42,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_675]. (let ((.cse1 (select v_main_a_675 main_x))) (let ((.cse0 (= (store v_main_a_675 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_675 main_y) 995) (= .cse1 5)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:30:42,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:30:43,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:43,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:43,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:43,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,074 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:43,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:43,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:43,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,093 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_676]. (let ((.cse2 (select v_main_a_676 main_y))) (let ((.cse0 (= (store v_main_a_676 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_676 main_x))) (or (and .cse0 (= 6 .cse1) (= 995 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:30:43,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:43,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:43,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:43,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:43,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,219 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:43,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:43,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:43,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_677]. (let ((.cse1 (select v_main_a_677 main_x))) (let ((.cse0 (= (store v_main_a_677 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 6 .cse1) (= 994 (select v_main_a_677 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:30:43,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:30:43,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:43,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:43,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:43,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,357 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:43,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:43,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:43,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_678]. (let ((.cse2 (select v_main_a_678 main_y))) (let ((.cse1 (= (store v_main_a_678 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_678 main_x))) (or (and (= .cse0 7) .cse1 (= .cse2 994)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:30:43,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:30:43,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:43,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:43,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:43,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,463 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:43,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:43,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:43,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_679]. (let ((.cse0 (select v_main_a_679 main_x))) (let ((.cse1 (= (store v_main_a_679 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 7 .cse0) (= 993 (select v_main_a_679 main_y)) .cse1)))) [2019-05-15 10:30:43,478 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:30:43,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:43,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:43,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:43,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,608 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:43,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:43,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:43,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_680]. (let ((.cse0 (select v_main_a_680 main_y))) (let ((.cse2 (select v_main_a_680 main_x)) (.cse1 (= (store v_main_a_680 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 993) .cse1 (= .cse2 8)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:30:43,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:43,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:43,719 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:43,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:43,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,756 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:43,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:43,757 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:43,769 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_681]. (let ((.cse1 (select v_main_a_681 main_x))) (let ((.cse0 (= main_a (store v_main_a_681 main_x (+ .cse1 1))))) (or (and .cse0 (= 8 .cse1) (= 992 (select v_main_a_681 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:30:43,769 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:30:43,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:43,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:43,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:43,847 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,873 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:43,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:43,874 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:43,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_682]. (let ((.cse1 (select v_main_a_682 main_y))) (let ((.cse0 (select v_main_a_682 main_x)) (.cse2 (= (store v_main_a_682 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 9) (= .cse1 992) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:30:43,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:30:43,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:43,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:43,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:43,967 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,004 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:44,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:44,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:44,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_683]. (let ((.cse0 (select v_main_a_683 main_x))) (let ((.cse1 (= (store v_main_a_683 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_683 main_y) 991) (= .cse0 9) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:30:44,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:30:44,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:44,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:44,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:44,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:44,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,116 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:44,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:44,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:44,147 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_684]. (let ((.cse2 (select v_main_a_684 main_y))) (let ((.cse1 (select v_main_a_684 main_x)) (.cse0 (= (store v_main_a_684 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 10 .cse1) .cse0 (= 991 .cse2))))) [2019-05-15 10:30:44,148 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:44,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:44,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:44,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:44,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,264 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:44,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:44,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:44,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_685]. (let ((.cse1 (select v_main_a_685 main_x))) (let ((.cse0 (= (store v_main_a_685 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 10 .cse1) (= (select v_main_a_685 main_y) 990) .cse0)))) [2019-05-15 10:30:44,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:30:44,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:44,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:44,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:44,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,406 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:44,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:44,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:44,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_686]. (let ((.cse2 (select v_main_a_686 main_y))) (let ((.cse1 (select v_main_a_686 main_x)) (.cse0 (= (store v_main_a_686 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= .cse1 11) (= .cse2 990)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:30:44,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:30:44,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:44,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:44,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:44,498 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,521 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:44,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:44,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:44,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_687]. (let ((.cse1 (select v_main_a_687 main_x))) (let ((.cse0 (= main_a (store v_main_a_687 main_x (+ .cse1 1))))) (or (and .cse0 (= 989 (select v_main_a_687 main_y)) (= 11 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:30:44,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:30:44,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:44,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:44,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:44,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,642 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:44,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:44,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:44,670 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_688]. (let ((.cse2 (select v_main_a_688 main_y))) (let ((.cse0 (= (store v_main_a_688 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_688 main_x))) (or (and .cse0 (= 12 .cse1) (= 989 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:30:44,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:44,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:44,745 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:44,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:44,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,789 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:44,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:44,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:44,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_689]. (let ((.cse1 (select v_main_a_689 main_x))) (let ((.cse0 (= (store v_main_a_689 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 12) (= (select v_main_a_689 main_y) 988)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:30:44,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:30:44,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:44,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:44,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:44,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,921 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:44,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:44,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:44,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_690]. (let ((.cse0 (select v_main_a_690 main_y))) (let ((.cse1 (select v_main_a_690 main_x)) (.cse2 (= (store v_main_a_690 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 988) (= 13 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:30:44,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:45,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:45,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:45,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:45,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,074 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:45,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:45,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:45,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_691]. (let ((.cse1 (select v_main_a_691 main_x))) (let ((.cse0 (= (store v_main_a_691 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 13 .cse1) (= (select v_main_a_691 main_y) 987)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:45,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:30:45,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:45,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:45,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:45,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,341 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:45,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:45,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:45,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_692]. (let ((.cse2 (select v_main_a_692 main_y))) (let ((.cse0 (select v_main_a_692 main_x)) (.cse1 (= main_a (store v_main_a_692 main_y (+ .cse2 (- 1)))))) (or (and (= 14 .cse0) .cse1 (= 987 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:30:45,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:30:45,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:45,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:45,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:45,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,539 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:45,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:45,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:45,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_693]. (let ((.cse0 (select v_main_a_693 main_x))) (let ((.cse1 (= (store v_main_a_693 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 986 (select v_main_a_693 main_y)) (= .cse0 14) .cse1)))) [2019-05-15 10:30:45,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:30:45,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:45,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:45,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:45,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,642 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:45,643 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,668 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:45,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:45,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:45,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_694]. (let ((.cse2 (select v_main_a_694 main_y))) (let ((.cse0 (= (store v_main_a_694 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_694 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 986 .cse2) .cse0 (= 15 .cse1))))) [2019-05-15 10:30:45,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:45,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:45,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:45,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:45,828 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,852 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:45,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:45,853 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:45,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_695]. (let ((.cse1 (select v_main_a_695 main_x))) (let ((.cse0 (= (store v_main_a_695 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 985 (select v_main_a_695 main_y)) (= .cse1 15) .cse0)))) [2019-05-15 10:30:45,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:30:45,929 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:45,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:45,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:45,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:45,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,990 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:45,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:45,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:46,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:46,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_696]. (let ((.cse2 (select v_main_a_696 main_y))) (let ((.cse0 (select v_main_a_696 main_x)) (.cse1 (= (store v_main_a_696 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 16) (= 985 .cse2) .cse1)))) [2019-05-15 10:30:46,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:46,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:46,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:46,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:46,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:46,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,140 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:46,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:46,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:46,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:46,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_697]. (let ((.cse1 (select v_main_a_697 main_x))) (let ((.cse0 (= (store v_main_a_697 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_697 main_y) 984) (= 16 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:46,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:30:46,221 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:46,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:46,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:46,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:46,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:46,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,268 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:46,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:46,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:46,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:46,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_698]. (let ((.cse2 (select v_main_a_698 main_y))) (let ((.cse0 (= main_a (store v_main_a_698 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_698 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 17) (= .cse2 984))))) [2019-05-15 10:30:46,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:30:46,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:46,367 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:46,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:46,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:46,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,399 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:46,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:46,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:46,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:46,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_699]. (let ((.cse1 (select v_main_a_699 main_x))) (let ((.cse0 (= main_a (store v_main_a_699 main_x (+ .cse1 1))))) (or (and (= 983 (select v_main_a_699 main_y)) .cse0 (= 17 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:46,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:30:46,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:46,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:46,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:46,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:46,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:46,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,544 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:46,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:46,545 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:46,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:46,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_700]. (let ((.cse2 (select v_main_a_700 main_y))) (let ((.cse1 (= (store v_main_a_700 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_700 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 983 .cse2) .cse1 (= .cse0 18))))) [2019-05-15 10:30:46,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:46,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:46,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:46,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:46,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:46,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,717 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:46,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:46,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:46,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:46,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_701]. (let ((.cse1 (select v_main_a_701 main_x))) (let ((.cse0 (= (store v_main_a_701 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= (select v_main_a_701 main_y) 982) (= 18 .cse1))))) [2019-05-15 10:30:46,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:30:46,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:46,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:46,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:46,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:46,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,848 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:46,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:46,848 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:46,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:46,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_702]. (let ((.cse2 (select v_main_a_702 main_y))) (let ((.cse0 (= (store v_main_a_702 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_702 main_x))) (or (and .cse0 (= .cse1 19) (= .cse2 982)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:30:46,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:30:46,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:46,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:46,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:46,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:46,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:46,987 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:46,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:46,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:47,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:47,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_703]. (let ((.cse0 (select v_main_a_703 main_x))) (let ((.cse1 (= (store v_main_a_703 main_x (+ .cse0 1)) main_a))) (or (and (= 19 .cse0) (= (select v_main_a_703 main_y) 981) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:30:47,000 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:30:47,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:47,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:47,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:47,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:47,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:47,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,136 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:47,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:47,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:47,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:47,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_704]. (let ((.cse2 (select v_main_a_704 main_y))) (let ((.cse0 (select v_main_a_704 main_x)) (.cse1 (= (store v_main_a_704 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 981 .cse2) (= 20 .cse0) .cse1)))) [2019-05-15 10:30:47,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:47,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:47,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:47,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:47,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:47,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,293 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:47,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:47,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:47,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:47,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_705]. (let ((.cse0 (select v_main_a_705 main_x))) (let ((.cse1 (= (store v_main_a_705 main_x (+ .cse0 1)) main_a))) (or (and (= 980 (select v_main_a_705 main_y)) (= 20 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:30:47,306 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:30:47,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:47,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:47,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:47,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:47,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:47,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,437 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:47,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:47,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:47,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:47,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_706]. (let ((.cse2 (select v_main_a_706 main_y))) (let ((.cse0 (select v_main_a_706 main_x)) (.cse1 (= (store v_main_a_706 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 21 .cse0) .cse1 (= 980 .cse2))))) [2019-05-15 10:30:47,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:47,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:47,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:47,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:47,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:47,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,623 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:47,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:47,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:47,635 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:47,635 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_707]. (let ((.cse1 (select v_main_a_707 main_x))) (let ((.cse0 (= (store v_main_a_707 main_x (+ .cse1 1)) main_a))) (or (and (= 979 (select v_main_a_707 main_y)) .cse0 (= 21 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:30:47,635 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:30:47,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:47,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:47,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:47,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:47,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,779 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:47,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:47,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:47,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:47,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_708]. (let ((.cse1 (select v_main_a_708 main_y))) (let ((.cse0 (select v_main_a_708 main_x)) (.cse2 (= (store v_main_a_708 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 22) (= 979 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:30:47,791 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:30:47,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:47,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:47,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:47,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:47,898 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:47,923 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:47,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:47,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:47,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:47,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_709]. (let ((.cse0 (select v_main_a_709 main_x))) (let ((.cse1 (= (store v_main_a_709 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 22 .cse0) .cse1 (= (select v_main_a_709 main_y) 978))))) [2019-05-15 10:30:47,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:30:48,042 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:48,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:48,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:48,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:48,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,107 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:48,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:48,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:48,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_710]. (let ((.cse2 (select v_main_a_710 main_y))) (let ((.cse1 (= (store v_main_a_710 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_710 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 23) (= .cse2 978))))) [2019-05-15 10:30:48,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:48,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:48,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:48,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:48,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,343 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:48,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:48,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:48,352 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_711]. (let ((.cse1 (select v_main_a_711 main_x))) (let ((.cse0 (= (store v_main_a_711 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_711 main_y) 977) (= 23 .cse1) .cse0)))) [2019-05-15 10:30:48,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:30:48,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:48,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:48,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:48,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,518 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:48,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:48,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:48,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_712]. (let ((.cse0 (select v_main_a_712 main_y))) (let ((.cse1 (select v_main_a_712 main_x)) (.cse2 (= main_a (store v_main_a_712 main_y (+ .cse0 (- 1)))))) (or (and (= 977 .cse0) (= .cse1 24) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:30:48,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:48,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:48,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:48,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:48,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,715 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:48,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:48,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:48,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_713]. (let ((.cse0 (select v_main_a_713 main_x))) (let ((.cse1 (= (store v_main_a_713 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 976 (select v_main_a_713 main_y)) .cse1 (= 24 .cse0))))) [2019-05-15 10:30:48,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:30:48,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:48,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:48,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:48,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:48,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,855 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:48,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:48,856 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:48,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_714]. (let ((.cse2 (select v_main_a_714 main_y))) (let ((.cse0 (= (store v_main_a_714 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_714 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 976 .cse2) .cse0 (= 25 .cse1))))) [2019-05-15 10:30:48,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:49,043 INFO L273 TraceCheckUtils]: 0: Hoare triple {5890#true} a := a[x := 0]; {5895#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:30:49,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {5895#(= (select main_a main_x) 0)} a := a[y := 1000]; {5899#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:30:49,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {5899#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {5903#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:30:49,046 INFO L273 TraceCheckUtils]: 3: Hoare triple {5903#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {5907#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,047 INFO L273 TraceCheckUtils]: 4: Hoare triple {5907#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5911#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:30:49,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {5911#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {5915#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {5915#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5919#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:30:49,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {5919#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {5923#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {5923#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5927#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:30:49,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {5927#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {5931#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {5931#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5935#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:30:49,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {5935#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {5939#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {5939#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5943#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:30:49,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {5943#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {5947#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:30:49,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {5947#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {5951#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:30:49,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {5951#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {5955#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:30:49,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {5955#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {5959#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:30:49,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {5959#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {5963#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:30:49,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {5963#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {5967#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:30:49,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {5967#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {5971#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {5971#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5975#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:30:49,067 INFO L273 TraceCheckUtils]: 21: Hoare triple {5975#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {5979#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,068 INFO L273 TraceCheckUtils]: 22: Hoare triple {5979#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5983#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:30:49,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {5983#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {5987#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:30:49,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {5987#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {5991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:30:49,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {5991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {5995#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {5995#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {5999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:30:49,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {5999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {6003#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {6003#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:30:49,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {6007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {6011#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:30:49,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {6011#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {6015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:30:49,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {6015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {6019#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {6019#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:30:49,081 INFO L273 TraceCheckUtils]: 33: Hoare triple {6023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {6027#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,082 INFO L273 TraceCheckUtils]: 34: Hoare triple {6027#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:30:49,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {6031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {6035#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:30:49,084 INFO L273 TraceCheckUtils]: 36: Hoare triple {6035#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {6039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:30:49,085 INFO L273 TraceCheckUtils]: 37: Hoare triple {6039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {6043#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,086 INFO L273 TraceCheckUtils]: 38: Hoare triple {6043#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:30:49,087 INFO L273 TraceCheckUtils]: 39: Hoare triple {6047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {6051#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:30:49,089 INFO L273 TraceCheckUtils]: 40: Hoare triple {6051#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {6055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:30:49,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {6055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {6059#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {6059#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6063#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:30:49,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {6063#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {6067#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,093 INFO L273 TraceCheckUtils]: 44: Hoare triple {6067#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6071#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:30:49,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {6071#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {6075#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:30:49,096 INFO L273 TraceCheckUtils]: 46: Hoare triple {6075#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {6079#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:30:49,097 INFO L273 TraceCheckUtils]: 47: Hoare triple {6079#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {6083#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,098 INFO L273 TraceCheckUtils]: 48: Hoare triple {6083#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6087#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:30:49,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {6087#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {6091#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,101 INFO L273 TraceCheckUtils]: 50: Hoare triple {6091#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6095#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:30:49,102 INFO L273 TraceCheckUtils]: 51: Hoare triple {6095#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {6099#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:30:49,103 INFO L273 TraceCheckUtils]: 52: Hoare triple {6099#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {5891#false} is VALID [2019-05-15 10:30:49,103 INFO L273 TraceCheckUtils]: 53: Hoare triple {5891#false} assume !(a[y] <= 0); {5891#false} is VALID [2019-05-15 10:30:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:49,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:49,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-15 10:30:49,116 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-05-15 10:30:49,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:49,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2019-05-15 10:30:49,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:49,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-05-15 10:30:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-15 10:30:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-05-15 10:30:49,227 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-05-15 10:30:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:56,588 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:30:56,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-15 10:30:56,589 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-05-15 10:30:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-05-15 10:30:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-05-15 10:30:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-05-15 10:30:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-05-15 10:30:56,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2019-05-15 10:30:56,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:56,666 INFO L225 Difference]: With dead ends: 57 [2019-05-15 10:30:56,667 INFO L226 Difference]: Without dead ends: 57 [2019-05-15 10:30:56,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-05-15 10:30:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-05-15 10:30:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-05-15 10:30:56,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:56,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2019-05-15 10:30:56,669 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2019-05-15 10:30:56,670 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2019-05-15 10:30:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:56,671 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:30:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:30:56,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:56,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:56,671 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2019-05-15 10:30:56,671 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2019-05-15 10:30:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:56,672 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:30:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:30:56,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:56,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:56,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:56,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-05-15 10:30:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-05-15 10:30:56,674 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-05-15 10:30:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:56,674 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-05-15 10:30:56,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-05-15 10:30:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:30:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-05-15 10:30:56,675 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:56,675 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-05-15 10:30:56,675 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1444613149, now seen corresponding path program 26 times [2019-05-15 10:30:56,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:56,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-15 10:30:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:56,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:56,791 INFO L375 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 6 treesize of output 5 [2019-05-15 10:30:56,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:56,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_715]. (= (store v_main_a_715 main_x 0) main_a) [2019-05-15 10:30:56,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:30:56,825 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:30:56,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,841 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:30:56,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:30:56,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_716]. (and (= 0 (select v_main_a_716 main_x)) (= (store v_main_a_716 main_y 1000) main_a)) [2019-05-15 10:30:56,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:30:56,976 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:56,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:57,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:57,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,315 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:30:57,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:57,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,347 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:57,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:57,348 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:57,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_717]. (let ((.cse2 (select v_main_a_717 main_x))) (let ((.cse0 (= (store v_main_a_717 main_x (+ .cse2 1)) main_a)) (.cse1 (= 1000 (select v_main_a_717 main_y)))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 (= 0 .cse2) .cse1)))) [2019-05-15 10:30:57,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:30:57,395 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:57,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:57,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:57,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:57,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,452 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:57,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:57,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:57,467 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_718]. (let ((.cse2 (select v_main_a_718 main_y))) (let ((.cse0 (select v_main_a_718 main_x)) (.cse1 (= (store v_main_a_718 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 1 .cse0) (= 1000 .cse2) .cse1)))) [2019-05-15 10:30:57,468 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:57,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:57,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:57,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:57,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,555 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:57,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:57,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:57,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_719]. (let ((.cse1 (select v_main_a_719 main_x))) (let ((.cse0 (= (store v_main_a_719 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= 999 (select v_main_a_719 main_y)) (= .cse1 1))))) [2019-05-15 10:30:57,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:30:57,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:57,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:57,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:57,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,664 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:57,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:57,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:57,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_720]. (let ((.cse2 (select v_main_a_720 main_y))) (let ((.cse0 (select v_main_a_720 main_x)) (.cse1 (= (store v_main_a_720 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 2) .cse1 (= 999 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:30:57,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:57,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:57,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:57,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:57,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,773 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:57,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:57,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:57,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_721]. (let ((.cse1 (select v_main_a_721 main_x))) (let ((.cse0 (= (store v_main_a_721 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_721 main_y) 998) (= .cse1 2))))) [2019-05-15 10:30:57,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:30:57,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:57,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:57,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:57,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:57,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,869 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:57,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:57,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:57,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_722]. (let ((.cse2 (select v_main_a_722 main_y))) (let ((.cse1 (select v_main_a_722 main_x)) (.cse0 (= (store v_main_a_722 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 3) .cse0 (= .cse2 998))))) [2019-05-15 10:30:57,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:57,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:57,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:57,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:57,956 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,980 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:57,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:57,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:57,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_723]. (let ((.cse1 (select v_main_a_723 main_x))) (let ((.cse0 (= (store v_main_a_723 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 3) (= (select v_main_a_723 main_y) 997)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:30:57,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:30:58,028 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:58,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:58,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:58,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,076 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:58,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:58,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:58,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_724]. (let ((.cse2 (select v_main_a_724 main_y))) (let ((.cse0 (select v_main_a_724 main_x)) (.cse1 (= (store v_main_a_724 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 997 .cse2) (= .cse0 4) .cse1)))) [2019-05-15 10:30:58,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:58,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:58,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:58,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,207 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:58,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:58,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:58,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_725]. (let ((.cse0 (select v_main_a_725 main_x))) (let ((.cse1 (= (store v_main_a_725 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 4) .cse1 (= (select v_main_a_725 main_y) 996)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:30:58,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:30:58,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:58,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:58,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,309 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:58,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:58,310 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:58,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_726]. (let ((.cse0 (select v_main_a_726 main_y))) (let ((.cse1 (select v_main_a_726 main_x)) (.cse2 (= (store v_main_a_726 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 996) (= 5 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:30:58,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:58,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:58,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:58,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,430 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:58,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:58,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:58,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_727]. (let ((.cse0 (select v_main_a_727 main_x))) (let ((.cse1 (= (store v_main_a_727 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_727 main_y) 995) .cse1 (= 5 .cse0))))) [2019-05-15 10:30:58,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:30:58,485 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:58,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:58,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,506 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:58,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,542 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:58,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:58,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:58,583 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_728]. (let ((.cse2 (select v_main_a_728 main_y))) (let ((.cse0 (= (store v_main_a_728 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_728 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 995 .cse2) .cse0 (= .cse1 6))))) [2019-05-15 10:30:58,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:58,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:58,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:58,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,674 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:58,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:58,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:58,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_729]. (let ((.cse1 (select v_main_a_729 main_x))) (let ((.cse0 (= (store v_main_a_729 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_729 main_y) 994) (= 6 .cse1))))) [2019-05-15 10:30:58,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:30:58,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:58,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:58,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:58,753 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,777 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:58,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:58,777 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:58,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_730]. (let ((.cse2 (select v_main_a_730 main_y))) (let ((.cse0 (select v_main_a_730 main_x)) (.cse1 (= main_a (store v_main_a_730 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 7 .cse0) .cse1 (= .cse2 994))))) [2019-05-15 10:30:58,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:30:58,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:58,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:58,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,927 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:58,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:58,928 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:58,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_731]. (let ((.cse0 (select v_main_a_731 main_x))) (let ((.cse1 (= (store v_main_a_731 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 993 (select v_main_a_731 main_y)) (= .cse0 7) .cse1)))) [2019-05-15 10:30:58,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:30:58,988 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:58,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:58,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:58,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,037 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:59,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:59,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:59,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_732]. (let ((.cse2 (select v_main_a_732 main_y))) (let ((.cse1 (= (store v_main_a_732 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_732 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 8 .cse0) (= .cse2 993))))) [2019-05-15 10:30:59,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:30:59,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:59,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:59,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,145 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:59,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:59,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:59,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_733]. (let ((.cse1 (select v_main_a_733 main_x))) (let ((.cse0 (= main_a (store v_main_a_733 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= (select v_main_a_733 main_y) 992) (= .cse1 8))))) [2019-05-15 10:30:59,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:30:59,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:59,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:59,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:59,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,256 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:59,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:59,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:59,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_734]. (let ((.cse2 (select v_main_a_734 main_y))) (let ((.cse0 (= main_a (store v_main_a_734 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_734 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 9 .cse1) (= .cse2 992))))) [2019-05-15 10:30:59,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:30:59,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:59,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:30:59,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,383 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:59,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:59,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:59,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_735]. (let ((.cse1 (select v_main_a_735 main_x))) (let ((.cse0 (= (store v_main_a_735 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 991 (select v_main_a_735 main_y)) (= .cse1 9)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:30:59,394 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:30:59,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:59,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:59,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,502 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:59,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:59,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:59,530 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_736]. (let ((.cse1 (select v_main_a_736 main_y))) (let ((.cse0 (= (store v_main_a_736 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_736 main_x))) (or (and .cse0 (= 991 .cse1) (= .cse2 10)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:30:59,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:30:59,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:59,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:59,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,635 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:59,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:59,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:59,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_737]. (let ((.cse1 (select v_main_a_737 main_x))) (let ((.cse0 (= (store v_main_a_737 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 10 .cse1) (= 990 (select v_main_a_737 main_y)))))) [2019-05-15 10:30:59,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:30:59,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:59,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:59,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,758 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:59,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:59,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:59,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_738]. (let ((.cse0 (select v_main_a_738 main_y))) (let ((.cse1 (select v_main_a_738 main_x)) (.cse2 (= (store v_main_a_738 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 990 .cse0) (= 11 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:30:59,769 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:30:59,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:59,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:59,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,879 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:30:59,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:30:59,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:30:59,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,893 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_739]. (let ((.cse0 (select v_main_a_739 main_x))) (let ((.cse1 (= main_a (store v_main_a_739 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 11 .cse0) (= (select v_main_a_739 main_y) 989) .cse1)))) [2019-05-15 10:30:59,893 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:30:59,955 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:30:59,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:30:59,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:30:59,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:30:59,979 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,005 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:00,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:00,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:00,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_740]. (let ((.cse2 (select v_main_a_740 main_y))) (let ((.cse0 (select v_main_a_740 main_x)) (.cse1 (= (store v_main_a_740 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 12) .cse1 (= 989 .cse2))))) [2019-05-15 10:31:00,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:00,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:00,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:00,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:00,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,180 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:00,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:00,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:00,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_741]. (let ((.cse1 (select v_main_a_741 main_x))) (let ((.cse0 (= (store v_main_a_741 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= (select v_main_a_741 main_y) 988) (= 12 .cse1))))) [2019-05-15 10:31:00,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:31:00,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:00,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:00,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:00,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:00,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,344 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:00,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:00,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:00,380 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,380 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_742]. (let ((.cse2 (select v_main_a_742 main_y))) (let ((.cse1 (select v_main_a_742 main_x)) (.cse0 (= (store v_main_a_742 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 13) (= .cse2 988) .cse0)))) [2019-05-15 10:31:00,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:00,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:00,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:00,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:00,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,638 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:00,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:00,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:00,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_743]. (let ((.cse1 (select v_main_a_743 main_x))) (let ((.cse0 (= main_a (store v_main_a_743 main_x (+ .cse1 1))))) (or (and .cse0 (= 13 .cse1) (= (select v_main_a_743 main_y) 987)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:31:00,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:31:00,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:00,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:00,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:00,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,797 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:00,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,837 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:00,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:00,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:00,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_744]. (let ((.cse2 (select v_main_a_744 main_y))) (let ((.cse0 (select v_main_a_744 main_x)) (.cse1 (= main_a (store v_main_a_744 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 14 .cse0) (= .cse2 987) .cse1)))) [2019-05-15 10:31:00,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:31:00,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:00,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:00,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:00,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,967 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:00,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:00,968 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:00,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,979 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_745]. (let ((.cse1 (select v_main_a_745 main_x))) (let ((.cse0 (= main_a (store v_main_a_745 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= 986 (select v_main_a_745 main_y)) (= .cse1 14))))) [2019-05-15 10:31:00,979 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:31:01,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:01,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:01,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:01,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,098 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:01,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:01,099 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:01,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_746]. (let ((.cse1 (select v_main_a_746 main_y))) (let ((.cse2 (= (store v_main_a_746 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_746 main_x))) (or (and (= .cse0 15) (= 986 .cse1) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:31:01,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:01,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:01,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:01,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:01,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,243 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:01,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:01,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:01,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_747]. (let ((.cse1 (select v_main_a_747 main_x))) (let ((.cse0 (= (store v_main_a_747 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_747 main_y) 985) (= 15 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:31:01,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:31:01,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:01,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:01,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:01,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:01,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,389 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:01,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:01,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:01,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,437 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_748]. (let ((.cse2 (select v_main_a_748 main_y))) (let ((.cse1 (select v_main_a_748 main_x)) (.cse0 (= (store v_main_a_748 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 16 .cse1) .cse0 (= 985 .cse2))))) [2019-05-15 10:31:01,437 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:01,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:01,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:01,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:01,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,569 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:01,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:01,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:01,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_749]. (let ((.cse0 (select v_main_a_749 main_x))) (let ((.cse1 (= (store v_main_a_749 main_x (+ .cse0 1)) main_a))) (or (and (= 984 (select v_main_a_749 main_y)) (= 16 .cse0) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:31:01,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:31:01,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:01,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:01,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:01,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:01,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,697 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:01,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:01,698 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:01,708 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_750]. (let ((.cse2 (select v_main_a_750 main_y))) (let ((.cse1 (select v_main_a_750 main_x)) (.cse0 (= (store v_main_a_750 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 984) (= .cse1 17) .cse0)))) [2019-05-15 10:31:01,708 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:31:01,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:01,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:01,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:01,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,826 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:01,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:01,826 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:01,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_751]. (let ((.cse1 (select v_main_a_751 main_x))) (let ((.cse0 (= (store v_main_a_751 main_x (+ .cse1 1)) main_a))) (or (and (= 983 (select v_main_a_751 main_y)) .cse0 (= 17 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:31:01,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:31:01,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:01,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:01,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:01,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:01,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,969 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:01,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:01,970 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:02,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:02,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_752]. (let ((.cse2 (select v_main_a_752 main_y))) (let ((.cse0 (select v_main_a_752 main_x)) (.cse1 (= (store v_main_a_752 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 18 .cse0) (= 983 .cse2) .cse1)))) [2019-05-15 10:31:02,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:02,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:02,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:02,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:02,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:02,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,149 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:02,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:02,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:02,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:02,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_753]. (let ((.cse1 (select v_main_a_753 main_x))) (let ((.cse0 (= (store v_main_a_753 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 18 .cse1) (= 982 (select v_main_a_753 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:31:02,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:31:02,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:02,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:02,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:02,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:02,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,276 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:02,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:02,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:02,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:02,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_754]. (let ((.cse0 (select v_main_a_754 main_y))) (let ((.cse1 (select v_main_a_754 main_x)) (.cse2 (= (store v_main_a_754 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 982) (= 19 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:31:02,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:31:02,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:02,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:02,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:02,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:02,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,410 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:02,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:02,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:02,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:02,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_755]. (let ((.cse1 (select v_main_a_755 main_x))) (let ((.cse0 (= (store v_main_a_755 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 19 .cse1) (= (select v_main_a_755 main_y) 981)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:31:02,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:31:02,503 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:02,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:02,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:02,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,525 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:02,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:02,526 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,560 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:02,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:02,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:02,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:02,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_756]. (let ((.cse2 (select v_main_a_756 main_y))) (let ((.cse0 (select v_main_a_756 main_x)) (.cse1 (= (store v_main_a_756 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 981 .cse2) (= .cse0 20) .cse1)))) [2019-05-15 10:31:02,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:02,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:02,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:02,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:02,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:02,725 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,749 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:02,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:02,750 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:02,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:02,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_757]. (let ((.cse0 (select v_main_a_757 main_x))) (let ((.cse1 (= (store v_main_a_757 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 20 .cse0) (= 980 (select v_main_a_757 main_y)))))) [2019-05-15 10:31:02,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:31:02,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:02,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:02,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:02,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:02,858 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:02,882 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:02,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:02,882 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:02,967 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:02,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_758]. (let ((.cse1 (select v_main_a_758 main_y))) (let ((.cse2 (select v_main_a_758 main_x)) (.cse0 (= (store v_main_a_758 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= 980 .cse1) (= 21 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse0)))) [2019-05-15 10:31:02,968 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:03,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:03,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:03,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:03,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:03,068 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,103 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:03,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:03,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:03,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:03,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_759]. (let ((.cse0 (select v_main_a_759 main_x))) (let ((.cse1 (= (store v_main_a_759 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 21) .cse1 (= 979 (select v_main_a_759 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:03,115 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:31:03,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:03,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:03,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:03,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:03,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,253 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:03,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:03,254 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:03,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:03,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_760]. (let ((.cse2 (select v_main_a_760 main_y))) (let ((.cse0 (= (store v_main_a_760 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_760 main_x))) (or (and .cse0 (= .cse1 22) (= .cse2 979)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:31:03,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:31:03,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:03,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:03,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:03,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:03,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,399 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:03,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:03,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:03,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:03,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_761]. (let ((.cse0 (select v_main_a_761 main_x))) (let ((.cse1 (= (store v_main_a_761 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 22) (= 978 (select v_main_a_761 main_y)))))) [2019-05-15 10:31:03,412 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:31:03,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:03,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:03,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:03,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:03,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:03,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,555 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:03,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:03,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:03,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:03,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_762]. (let ((.cse2 (select v_main_a_762 main_y))) (let ((.cse0 (select v_main_a_762 main_x)) (.cse1 (= (store v_main_a_762 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 23 .cse0) .cse1 (= 978 .cse2))))) [2019-05-15 10:31:03,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:03,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:03,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:03,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:03,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:03,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,719 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:03,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:03,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:03,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:03,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_763]. (let ((.cse0 (select v_main_a_763 main_x))) (let ((.cse1 (= (store v_main_a_763 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 977 (select v_main_a_763 main_y)) (= 23 .cse0) .cse1)))) [2019-05-15 10:31:03,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:31:03,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:03,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:03,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:03,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:03,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:03,863 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:03,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:03,864 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:03,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:03,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_764]. (let ((.cse0 (select v_main_a_764 main_y))) (let ((.cse1 (= (store v_main_a_764 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_764 main_x))) (or (and (= .cse0 977) .cse1 (= .cse2 24)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:31:03,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:04,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:04,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:04,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:04,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,100 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:04,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:04,100 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:04,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_765]. (let ((.cse0 (select v_main_a_765 main_x))) (let ((.cse1 (= (store v_main_a_765 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_765 main_y) 976) .cse1 (= .cse0 24))))) [2019-05-15 10:31:04,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:31:04,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:04,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:04,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:04,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,248 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:04,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:04,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:04,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_766]. (let ((.cse1 (select v_main_a_766 main_y))) (let ((.cse0 (= (store v_main_a_766 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_766 main_x))) (or (and .cse0 (= .cse1 976) (= .cse2 25)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:31:04,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:04,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:04,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:04,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:04,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,459 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:04,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:04,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:04,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_767]. (let ((.cse0 (select v_main_a_767 main_x))) (let ((.cse1 (= main_a (store v_main_a_767 main_x (+ .cse0 1))))) (or (and (= 25 .cse0) (= 975 (select v_main_a_767 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:04,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:31:04,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:04,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:04,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:04,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,615 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:04,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:04,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:04,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_768]. (let ((.cse0 (select v_main_a_768 main_y))) (let ((.cse1 (= (store v_main_a_768 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_768 main_x))) (or (and (= 975 .cse0) .cse1 (= 26 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:31:04,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:04,770 INFO L273 TraceCheckUtils]: 0: Hoare triple {6333#true} a := a[x := 0]; {6338#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:31:04,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {6338#(= (select main_a main_x) 0)} a := a[y := 1000]; {6342#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:31:04,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {6342#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {6346#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:31:04,774 INFO L273 TraceCheckUtils]: 3: Hoare triple {6346#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {6350#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,775 INFO L273 TraceCheckUtils]: 4: Hoare triple {6350#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6354#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:31:04,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {6354#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {6358#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {6358#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6362#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:31:04,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {6362#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {6366#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {6366#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6370#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:31:04,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {6370#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {6374#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {6374#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6378#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:31:04,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {6378#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {6382#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {6382#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6386#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:31:04,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {6386#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {6390#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:31:04,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {6390#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {6394#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:31:04,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {6394#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {6398#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:31:04,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {6398#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {6402#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:31:04,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {6402#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {6406#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:31:04,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {6406#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {6410#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:31:04,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {6410#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {6414#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {6414#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6418#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:31:04,795 INFO L273 TraceCheckUtils]: 21: Hoare triple {6418#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {6422#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {6422#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6426#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:31:04,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {6426#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {6430#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:31:04,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {6430#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {6434#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:31:04,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {6434#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {6438#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {6438#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6442#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:31:04,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {6442#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {6446#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {6446#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6450#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:31:04,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {6450#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {6454#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:31:04,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {6454#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {6458#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:31:04,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {6458#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {6462#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,868 INFO L273 TraceCheckUtils]: 32: Hoare triple {6462#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6466#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:31:04,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {6466#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {6470#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,870 INFO L273 TraceCheckUtils]: 34: Hoare triple {6470#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6474#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:31:04,870 INFO L273 TraceCheckUtils]: 35: Hoare triple {6474#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {6478#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:31:04,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {6478#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {6482#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:31:04,901 INFO L273 TraceCheckUtils]: 37: Hoare triple {6482#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {6486#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {6486#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6490#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:31:04,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {6490#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {6494#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:31:04,908 INFO L273 TraceCheckUtils]: 40: Hoare triple {6494#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {6498#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:31:04,909 INFO L273 TraceCheckUtils]: 41: Hoare triple {6498#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {6502#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {6502#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6506#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:31:04,912 INFO L273 TraceCheckUtils]: 43: Hoare triple {6506#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {6510#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,913 INFO L273 TraceCheckUtils]: 44: Hoare triple {6510#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6514#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:31:04,914 INFO L273 TraceCheckUtils]: 45: Hoare triple {6514#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {6518#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:31:04,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {6518#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {6522#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:31:04,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {6522#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {6526#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,917 INFO L273 TraceCheckUtils]: 48: Hoare triple {6526#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6530#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:31:04,919 INFO L273 TraceCheckUtils]: 49: Hoare triple {6530#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {6534#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,920 INFO L273 TraceCheckUtils]: 50: Hoare triple {6534#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6538#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:31:04,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {6538#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {6542#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,922 INFO L273 TraceCheckUtils]: 52: Hoare triple {6542#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6546#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:31:04,923 INFO L273 TraceCheckUtils]: 53: Hoare triple {6546#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {6550#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:04,924 INFO L273 TraceCheckUtils]: 54: Hoare triple {6550#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {6334#false} is VALID [2019-05-15 10:31:04,924 INFO L273 TraceCheckUtils]: 55: Hoare triple {6334#false} assume !(a[y] <= 0); {6334#false} is VALID [2019-05-15 10:31:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:04,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:04,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-15 10:31:04,938 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-05-15 10:31:04,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:04,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2019-05-15 10:31:05,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:05,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-05-15 10:31:05,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-15 10:31:05,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-05-15 10:31:05,015 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-05-15 10:31:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:12,805 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:12,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-15 10:31:12,805 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-05-15 10:31:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-05-15 10:31:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-05-15 10:31:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-05-15 10:31:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-05-15 10:31:12,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2019-05-15 10:31:12,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:12,887 INFO L225 Difference]: With dead ends: 59 [2019-05-15 10:31:12,888 INFO L226 Difference]: Without dead ends: 59 [2019-05-15 10:31:12,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-05-15 10:31:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-05-15 10:31:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-05-15 10:31:12,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:12,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:12,891 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:12,891 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:12,892 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:12,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:12,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:12,892 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:12,892 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:12,893 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:12,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:12,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:12,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:12,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-05-15 10:31:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-05-15 10:31:12,895 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-05-15 10:31:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:12,895 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-05-15 10:31:12,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-05-15 10:31:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-05-15 10:31:12,896 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:12,896 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-05-15 10:31:12,896 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:12,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:12,896 INFO L82 PathProgramCache]: Analyzing trace with hash 998646142, now seen corresponding path program 27 times [2019-05-15 10:31:12,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:12,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-15 10:31:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:12,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:13,077 INFO L375 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 6 treesize of output 5 [2019-05-15 10:31:13,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:13,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_769]. (= (store v_main_a_769 main_x 0) main_a) [2019-05-15 10:31:13,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:31:13,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:31:13,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,156 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:31:13,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:31:13,159 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,159 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_770]. (and (= (select v_main_a_770 main_x) 0) (= (store v_main_a_770 main_y 1000) main_a)) [2019-05-15 10:31:13,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:31:13,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:13,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:13,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:13,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,204 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:13,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,231 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:13,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:13,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:13,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_771]. (let ((.cse2 (select v_main_a_771 main_x))) (let ((.cse0 (= (select v_main_a_771 main_y) 1000)) (.cse1 (= (store v_main_a_771 main_x (+ .cse2 1)) main_a))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= 0 .cse2))))) [2019-05-15 10:31:13,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:31:13,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:13,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:13,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:13,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:13,296 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,320 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:13,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:13,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:13,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_772]. (let ((.cse2 (select v_main_a_772 main_y))) (let ((.cse1 (= (store v_main_a_772 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_772 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 1000 .cse2) .cse1 (= .cse0 1))))) [2019-05-15 10:31:13,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:13,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:13,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:13,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:13,397 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,432 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:13,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:13,433 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:13,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_773]. (let ((.cse0 (select v_main_a_773 main_x))) (let ((.cse1 (= (store v_main_a_773 main_x (+ .cse0 1)) main_a))) (or (and (= 1 .cse0) (= 999 (select v_main_a_773 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:13,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:31:13,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:13,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:13,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:13,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:13,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,542 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:13,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:13,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:13,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,605 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_774]. (let ((.cse2 (select v_main_a_774 main_y))) (let ((.cse1 (select v_main_a_774 main_x)) (.cse0 (= (store v_main_a_774 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 2) .cse0 (= .cse2 999))))) [2019-05-15 10:31:13,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:13,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:13,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:13,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:13,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,686 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:13,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:13,687 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:13,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_775]. (let ((.cse1 (select v_main_a_775 main_x))) (let ((.cse0 (= (store v_main_a_775 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 998 (select v_main_a_775 main_y)) .cse0 (= .cse1 2))))) [2019-05-15 10:31:13,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:31:13,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:13,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:13,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:13,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,785 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:13,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:13,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:13,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_776]. (let ((.cse2 (select v_main_a_776 main_y))) (let ((.cse0 (= (store v_main_a_776 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_776 main_x))) (or (and .cse0 (= 3 .cse1) (= .cse2 998)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:31:13,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:13,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:13,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:13,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,884 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:13,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,910 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:13,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:13,910 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:13,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,922 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_777]. (let ((.cse0 (select v_main_a_777 main_x))) (let ((.cse1 (= (store v_main_a_777 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 997 (select v_main_a_777 main_y)) (= .cse0 3) .cse1)))) [2019-05-15 10:31:13,922 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:31:13,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:13,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:13,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:13,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:13,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,007 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_778]. (let ((.cse2 (select v_main_a_778 main_y))) (let ((.cse0 (select v_main_a_778 main_x)) (.cse1 (= (store v_main_a_778 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 4 .cse0) .cse1 (= .cse2 997))))) [2019-05-15 10:31:14,042 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:14,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:14,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:14,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:14,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,139 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_779]. (let ((.cse0 (select v_main_a_779 main_x))) (let ((.cse1 (= (store v_main_a_779 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 4 .cse0) (= 996 (select v_main_a_779 main_y)) .cse1)))) [2019-05-15 10:31:14,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:31:14,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:14,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:14,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:14,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,243 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,280 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_780]. (let ((.cse0 (select v_main_a_780 main_y))) (let ((.cse1 (= (store v_main_a_780 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_780 main_x))) (or (and (= .cse0 996) .cse1 (= .cse2 5)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:31:14,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:14,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:14,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:14,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:14,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,371 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_781]. (let ((.cse0 (select v_main_a_781 main_x))) (let ((.cse1 (= (store v_main_a_781 main_x (+ .cse0 1)) main_a))) (or (and (= 5 .cse0) .cse1 (= (select v_main_a_781 main_y) 995)) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:14,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:31:14,429 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:14,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:14,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:14,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:14,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,487 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_782]. (let ((.cse2 (select v_main_a_782 main_y))) (let ((.cse1 (= (store v_main_a_782 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_782 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= 995 .cse2) (= .cse0 6))))) [2019-05-15 10:31:14,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:14,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:14,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:14,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:14,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,622 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,622 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_783]. (let ((.cse1 (select v_main_a_783 main_x))) (let ((.cse0 (= (store v_main_a_783 main_x (+ .cse1 1)) main_a))) (or (and (= 994 (select v_main_a_783 main_y)) .cse0 (= 6 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:31:14,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:31:14,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:14,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:14,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:14,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:14,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,729 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,738 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_784]. (let ((.cse2 (select v_main_a_784 main_y))) (let ((.cse0 (= (store v_main_a_784 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_784 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= .cse2 994) .cse0 (= 7 .cse1))))) [2019-05-15 10:31:14,738 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:31:14,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:14,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:14,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:14,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,845 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,846 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_785]. (let ((.cse0 (select v_main_a_785 main_x))) (let ((.cse1 (= (store v_main_a_785 main_x (+ .cse0 1)) main_a))) (or (and (= 7 .cse0) .cse1 (= (select v_main_a_785 main_y) 993)) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:31:14,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:31:14,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:14,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:14,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:14,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:14,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,951 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:14,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:14,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:14,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_786]. (let ((.cse2 (select v_main_a_786 main_y))) (let ((.cse0 (select v_main_a_786 main_x)) (.cse1 (= main_a (store v_main_a_786 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 993 .cse2) (= 8 .cse0) .cse1)))) [2019-05-15 10:31:14,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:31:15,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:15,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:15,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:15,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,055 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:15,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:15,055 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:15,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_787]. (let ((.cse1 (select v_main_a_787 main_x))) (let ((.cse0 (= main_a (store v_main_a_787 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 992 (select v_main_a_787 main_y)) (= 8 .cse1))))) [2019-05-15 10:31:15,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:31:15,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:15,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:15,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:15,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,164 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:15,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:15,165 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:15,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_788]. (let ((.cse0 (select v_main_a_788 main_y))) (let ((.cse2 (select v_main_a_788 main_x)) (.cse1 (= (store v_main_a_788 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 992 .cse0) .cse1 (= .cse2 9)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:31:15,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:31:15,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:15,244 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:15,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:15,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,286 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:15,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:15,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:15,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_789]. (let ((.cse1 (select v_main_a_789 main_x))) (let ((.cse0 (= (store v_main_a_789 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 9 .cse1) (= (select v_main_a_789 main_y) 991)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:31:15,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:31:15,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:15,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:15,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:15,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:15,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,392 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:15,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:15,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:15,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_790]. (let ((.cse2 (select v_main_a_790 main_y))) (let ((.cse1 (= (store v_main_a_790 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_790 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 10) (= .cse2 991))))) [2019-05-15 10:31:15,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:15,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:15,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:15,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:15,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,548 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:15,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:15,549 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:15,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_791]. (let ((.cse0 (select v_main_a_791 main_x))) (let ((.cse1 (= main_a (store v_main_a_791 main_x (+ .cse0 1))))) (or (and (= 990 (select v_main_a_791 main_y)) (= 10 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:15,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:31:15,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:15,630 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:15,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:15,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,661 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:15,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:15,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:15,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_792]. (let ((.cse1 (select v_main_a_792 main_y))) (let ((.cse0 (= (store v_main_a_792 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_792 main_x))) (or (and .cse0 (= .cse1 990) (= 11 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse2))))) [2019-05-15 10:31:15,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:31:15,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:15,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:15,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:15,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,817 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:15,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:15,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:15,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_793]. (let ((.cse1 (select v_main_a_793 main_x))) (let ((.cse0 (= (store v_main_a_793 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_793 main_y) 989) (= .cse1 11)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:31:15,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:31:15,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:15,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:15,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:15,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,014 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:16,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:16,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:16,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_794]. (let ((.cse1 (select v_main_a_794 main_y))) (let ((.cse0 (select v_main_a_794 main_x)) (.cse2 (= (store v_main_a_794 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 12 .cse0) (= 989 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:31:16,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:16,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:16,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:16,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:16,191 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,226 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:16,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:16,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:16,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_795]. (let ((.cse1 (select v_main_a_795 main_x))) (let ((.cse0 (= (store v_main_a_795 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 988 (select v_main_a_795 main_y)) (= 12 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:31:16,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:31:16,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:16,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:16,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:16,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:16,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,359 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:16,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:16,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:16,409 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,409 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_796]. (let ((.cse2 (select v_main_a_796 main_y))) (let ((.cse1 (select v_main_a_796 main_x)) (.cse0 (= (store v_main_a_796 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 13) .cse0 (= .cse2 988))))) [2019-05-15 10:31:16,409 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:16,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:16,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:16,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:16,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,528 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:16,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:16,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:16,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_797]. (let ((.cse1 (select v_main_a_797 main_x))) (let ((.cse0 (= (store v_main_a_797 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 987 (select v_main_a_797 main_y)) .cse0 (= 13 .cse1))))) [2019-05-15 10:31:16,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:31:16,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:16,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:16,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:16,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:16,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,663 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:16,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:16,663 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:16,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_798]. (let ((.cse2 (select v_main_a_798 main_y))) (let ((.cse0 (select v_main_a_798 main_x)) (.cse1 (= main_a (store v_main_a_798 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 987 .cse2) (= 14 .cse0) .cse1)))) [2019-05-15 10:31:16,674 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:31:16,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:16,757 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:16,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:16,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,787 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:16,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:16,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:16,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_799]. (let ((.cse1 (select v_main_a_799 main_x))) (let ((.cse0 (= main_a (store v_main_a_799 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_799 main_y) 986) .cse0 (= 14 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:31:16,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:31:16,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:16,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:16,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:16,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:16,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,914 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:16,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:16,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:16,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_800]. (let ((.cse2 (select v_main_a_800 main_y))) (let ((.cse0 (select v_main_a_800 main_x)) (.cse1 (= (store v_main_a_800 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 986) (= .cse0 15) .cse1)))) [2019-05-15 10:31:16,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:17,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:17,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:17,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:17,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,088 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:17,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:17,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:17,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_801]. (let ((.cse1 (select v_main_a_801 main_x))) (let ((.cse0 (= (store v_main_a_801 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 985 (select v_main_a_801 main_y)) (= 15 .cse1))))) [2019-05-15 10:31:17,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:31:17,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:17,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:17,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:17,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,230 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:17,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:17,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:17,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_802]. (let ((.cse0 (select v_main_a_802 main_y))) (let ((.cse1 (= (store v_main_a_802 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_802 main_x))) (or (and (= 985 .cse0) .cse1 (= 16 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:31:17,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:17,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:17,363 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:17,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:17,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,396 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:17,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:17,397 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:17,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_803]. (let ((.cse1 (select v_main_a_803 main_x))) (let ((.cse0 (= (store v_main_a_803 main_x (+ .cse1 1)) main_a))) (or (and (= 984 (select v_main_a_803 main_y)) .cse0 (= .cse1 16)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:31:17,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:31:17,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:17,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:17,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:17,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:17,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,540 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:17,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:17,541 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:17,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_804]. (let ((.cse2 (select v_main_a_804 main_y))) (let ((.cse1 (= (store v_main_a_804 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_804 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= .cse2 984) (= 17 .cse0))))) [2019-05-15 10:31:17,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:31:17,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:17,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:17,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:17,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,677 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:17,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:17,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:17,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_805]. (let ((.cse0 (select v_main_a_805 main_x))) (let ((.cse1 (= main_a (store v_main_a_805 main_x (+ .cse0 1))))) (or (and (= 983 (select v_main_a_805 main_y)) (= .cse0 17) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:31:17,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:31:17,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:17,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:17,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:17,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,827 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:17,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:17,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:17,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_806]. (let ((.cse1 (select v_main_a_806 main_y))) (let ((.cse2 (select v_main_a_806 main_x)) (.cse0 (= main_a (store v_main_a_806 main_y (+ .cse1 (- 1)))))) (or (and .cse0 (= .cse1 983) (= 18 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse0)))) [2019-05-15 10:31:17,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:17,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:17,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:17,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:17,988 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,013 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:18,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:18,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:18,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_807]. (let ((.cse0 (select v_main_a_807 main_x))) (let ((.cse1 (= main_a (store v_main_a_807 main_x (+ .cse0 1))))) (or (and (= .cse0 18) .cse1 (= (select v_main_a_807 main_y) 982)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:18,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:31:18,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:18,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:18,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:18,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:18,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,151 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:18,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:18,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:18,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_808]. (let ((.cse2 (select v_main_a_808 main_y))) (let ((.cse1 (= (store v_main_a_808 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_808 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 982) .cse1 (= 19 .cse0))))) [2019-05-15 10:31:18,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:31:18,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:18,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:18,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:18,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,289 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:18,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:18,290 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:18,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_809]. (let ((.cse0 (select v_main_a_809 main_x))) (let ((.cse1 (= (store v_main_a_809 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 19) (= (select v_main_a_809 main_y) 981) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:18,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:31:18,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:18,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:18,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:18,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:18,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,446 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:18,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:18,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:18,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_810]. (let ((.cse2 (select v_main_a_810 main_y))) (let ((.cse0 (select v_main_a_810 main_x)) (.cse1 (= (store v_main_a_810 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 20) .cse1 (= 981 .cse2))))) [2019-05-15 10:31:18,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:18,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:18,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:18,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,572 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:18,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,601 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:18,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:18,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:18,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_811]. (let ((.cse1 (select v_main_a_811 main_x))) (let ((.cse0 (= (store v_main_a_811 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_811 main_y) 980) .cse0 (= 20 .cse1))))) [2019-05-15 10:31:18,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:31:18,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:18,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:18,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:18,719 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,744 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:18,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:18,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:18,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_812]. (let ((.cse0 (select v_main_a_812 main_y))) (let ((.cse2 (select v_main_a_812 main_x)) (.cse1 (= (store v_main_a_812 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 980 .cse0) .cse1 (= 21 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:31:18,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:18,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:18,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:18,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:18,914 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,949 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:18,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:18,950 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:18,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_813]. (let ((.cse0 (select v_main_a_813 main_x))) (let ((.cse1 (= main_a (store v_main_a_813 main_x (+ .cse0 1))))) (or (and (= .cse0 21) .cse1 (= (select v_main_a_813 main_y) 979)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:18,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:31:19,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:19,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:19,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:19,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:19,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,088 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:19,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:19,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:19,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:19,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_814]. (let ((.cse1 (select v_main_a_814 main_y))) (let ((.cse0 (select v_main_a_814 main_x)) (.cse2 (= (store v_main_a_814 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 22 .cse0) (= 979 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:31:19,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:31:19,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:19,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:19,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:19,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:19,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,225 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:19,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:19,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:19,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:19,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_815]. (let ((.cse0 (select v_main_a_815 main_x))) (let ((.cse1 (= (store v_main_a_815 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 22 .cse0) .cse1 (= 978 (select v_main_a_815 main_y)))))) [2019-05-15 10:31:19,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:31:19,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:19,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:19,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:19,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:19,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,398 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:19,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:19,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:19,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:19,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_816]. (let ((.cse1 (select v_main_a_816 main_y))) (let ((.cse0 (select v_main_a_816 main_x)) (.cse2 (= (store v_main_a_816 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 23) (= 978 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:31:19,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:19,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:19,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:19,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:19,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:19,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,606 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:19,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:19,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:19,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:19,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_817]. (let ((.cse1 (select v_main_a_817 main_x))) (let ((.cse0 (= (store v_main_a_817 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 23 .cse1) (= (select v_main_a_817 main_y) 977) .cse0)))) [2019-05-15 10:31:19,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:31:19,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:19,724 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:19,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:19,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:19,733 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,757 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:19,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:19,757 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:19,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:19,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_818]. (let ((.cse1 (select v_main_a_818 main_y))) (let ((.cse0 (select v_main_a_818 main_x)) (.cse2 (= (store v_main_a_818 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 24 .cse0) (= .cse1 977) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:31:19,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:19,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:19,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:19,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,920 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:19,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:19,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:19,958 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:19,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:19,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:19,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:19,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_819]. (let ((.cse1 (select v_main_a_819 main_x))) (let ((.cse0 (= (store v_main_a_819 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 24 .cse1) .cse0 (= (select v_main_a_819 main_y) 976))))) [2019-05-15 10:31:19,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:31:20,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:20,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:20,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:20,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:20,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:20,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,104 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:20,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:20,105 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:20,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:20,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_820]. (let ((.cse2 (select v_main_a_820 main_y))) (let ((.cse1 (select v_main_a_820 main_x)) (.cse0 (= (store v_main_a_820 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 25 .cse1) (= .cse2 976) .cse0)))) [2019-05-15 10:31:20,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:20,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:20,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:20,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:20,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:20,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,301 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:20,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:20,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:20,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:20,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_821]. (let ((.cse1 (select v_main_a_821 main_x))) (let ((.cse0 (= (store v_main_a_821 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 25) (= 975 (select v_main_a_821 main_y))) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:31:20,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:31:20,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:20,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:20,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:20,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:20,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:20,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,453 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:20,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:20,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:20,499 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:20,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_822]. (let ((.cse2 (select v_main_a_822 main_y))) (let ((.cse0 (select v_main_a_822 main_x)) (.cse1 (= (store v_main_a_822 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 26 .cse0) (= .cse2 975) .cse1)))) [2019-05-15 10:31:20,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:20,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:20,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:20,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:20,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:20,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,640 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:20,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:20,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:20,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:20,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_823]. (let ((.cse0 (select v_main_a_823 main_x))) (let ((.cse1 (= (store v_main_a_823 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 974 (select v_main_a_823 main_y)) (= .cse0 26) .cse1)))) [2019-05-15 10:31:20,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:31:20,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:20,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:20,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:20,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:20,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:20,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:20,794 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:20,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:20,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:20,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:20,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_824]. (let ((.cse2 (select v_main_a_824 main_y))) (let ((.cse1 (= (store v_main_a_824 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_824 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 974) .cse1 (= 27 .cse0))))) [2019-05-15 10:31:20,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:21,066 INFO L273 TraceCheckUtils]: 0: Hoare triple {6792#true} a := a[x := 0]; {6797#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:31:21,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {6797#(= (select main_a main_x) 0)} a := a[y := 1000]; {6801#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:31:21,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {6801#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {6805#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:31:21,072 INFO L273 TraceCheckUtils]: 3: Hoare triple {6805#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {6809#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,072 INFO L273 TraceCheckUtils]: 4: Hoare triple {6809#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6813#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:31:21,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {6813#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {6817#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {6817#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6821#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:31:21,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {6821#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {6825#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {6825#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6829#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:31:21,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {6829#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {6833#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {6833#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6837#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:31:21,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {6837#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {6841#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {6841#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6845#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:31:21,083 INFO L273 TraceCheckUtils]: 13: Hoare triple {6845#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {6849#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:31:21,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {6849#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {6853#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:31:21,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {6853#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {6857#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:31:21,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {6857#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {6861#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:31:21,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {6861#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {6865#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:31:21,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {6865#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {6869#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:31:21,094 INFO L273 TraceCheckUtils]: 19: Hoare triple {6869#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {6873#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {6873#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6877#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:31:21,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {6877#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {6881#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {6881#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6885#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:31:21,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {6885#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {6889#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:31:21,104 INFO L273 TraceCheckUtils]: 24: Hoare triple {6889#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {6893#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:31:21,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {6893#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {6897#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {6897#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6901#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:31:21,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {6901#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {6905#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {6905#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6909#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:31:21,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {6909#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {6913#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:31:21,112 INFO L273 TraceCheckUtils]: 30: Hoare triple {6913#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {6917#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:31:21,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {6917#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {6921#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {6921#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6925#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:31:21,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {6925#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {6929#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {6929#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6933#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:31:21,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {6933#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {6937#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:31:21,119 INFO L273 TraceCheckUtils]: 36: Hoare triple {6937#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {6941#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:31:21,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {6941#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {6945#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,128 INFO L273 TraceCheckUtils]: 38: Hoare triple {6945#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6949#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:31:21,131 INFO L273 TraceCheckUtils]: 39: Hoare triple {6949#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {6953#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:31:21,133 INFO L273 TraceCheckUtils]: 40: Hoare triple {6953#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {6957#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:31:21,133 INFO L273 TraceCheckUtils]: 41: Hoare triple {6957#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {6961#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {6961#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6965#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:31:21,135 INFO L273 TraceCheckUtils]: 43: Hoare triple {6965#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {6969#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {6969#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6973#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:31:21,137 INFO L273 TraceCheckUtils]: 45: Hoare triple {6973#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {6977#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:31:21,138 INFO L273 TraceCheckUtils]: 46: Hoare triple {6977#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {6981#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:31:21,139 INFO L273 TraceCheckUtils]: 47: Hoare triple {6981#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {6985#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {6985#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6989#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:31:21,146 INFO L273 TraceCheckUtils]: 49: Hoare triple {6989#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {6993#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,147 INFO L273 TraceCheckUtils]: 50: Hoare triple {6993#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {6997#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:31:21,149 INFO L273 TraceCheckUtils]: 51: Hoare triple {6997#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {7001#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,149 INFO L273 TraceCheckUtils]: 52: Hoare triple {7001#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7005#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:31:21,150 INFO L273 TraceCheckUtils]: 53: Hoare triple {7005#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {7009#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,151 INFO L273 TraceCheckUtils]: 54: Hoare triple {7009#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7013#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:31:21,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {7013#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {7017#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:21,152 INFO L273 TraceCheckUtils]: 56: Hoare triple {7017#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {6793#false} is VALID [2019-05-15 10:31:21,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {6793#false} assume !(a[y] <= 0); {6793#false} is VALID [2019-05-15 10:31:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:21,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:21,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-15 10:31:21,168 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-05-15 10:31:21,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:21,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2019-05-15 10:31:21,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:21,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-05-15 10:31:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-15 10:31:21,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-05-15 10:31:21,269 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-05-15 10:31:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:29,779 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:31:29,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-15 10:31:29,779 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-05-15 10:31:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-05-15 10:31:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-05-15 10:31:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-05-15 10:31:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-05-15 10:31:29,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2019-05-15 10:31:29,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:29,867 INFO L225 Difference]: With dead ends: 61 [2019-05-15 10:31:29,867 INFO L226 Difference]: Without dead ends: 61 [2019-05-15 10:31:29,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-05-15 10:31:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-05-15 10:31:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-05-15 10:31:29,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:29,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:29,870 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:29,870 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:29,871 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:31:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:31:29,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:29,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:29,872 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:29,872 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:29,873 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:31:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:31:29,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:29,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:29,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:29,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-05-15 10:31:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-05-15 10:31:29,875 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-05-15 10:31:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:29,875 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-05-15 10:31:29,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-05-15 10:31:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:31:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-05-15 10:31:29,876 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:29,876 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-05-15 10:31:29,876 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1921082015, now seen corresponding path program 28 times [2019-05-15 10:31:29,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:29,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-15 10:31:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:29,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:30,058 INFO L375 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 6 treesize of output 5 [2019-05-15 10:31:30,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:30,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_825]. (= (store v_main_a_825 main_x 0) main_a) [2019-05-15 10:31:30,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:31:30,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:31:30,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,100 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:31:30,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:31:30,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_826]. (and (= (store v_main_a_826 main_y 1000) main_a) (= 0 (select v_main_a_826 main_x))) [2019-05-15 10:31:30,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:31:30,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:30,146 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:30,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:30,153 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,177 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:30,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:30,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:30,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_827]. (let ((.cse0 (select v_main_a_827 main_x))) (let ((.cse1 (= (store v_main_a_827 main_x (+ .cse0 1)) main_a)) (.cse2 (= 1000 (select v_main_a_827 main_y)))) (or (and (= 0 .cse0) .cse1 .cse2) (and (= main_y main_x) .cse1 .cse2)))) [2019-05-15 10:31:30,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:31:30,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:30,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:30,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:30,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,269 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:30,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:30,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:30,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_828]. (let ((.cse0 (select v_main_a_828 main_y))) (let ((.cse2 (select v_main_a_828 main_x)) (.cse1 (= (store v_main_a_828 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 1000 .cse0) .cse1 (= 1 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:31:30,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:30,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:30,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:30,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:30,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,393 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:30,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:30,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:30,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_829]. (let ((.cse1 (select v_main_a_829 main_x))) (let ((.cse0 (= main_a (store v_main_a_829 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 999 (select v_main_a_829 main_y)) (= 1 .cse1))))) [2019-05-15 10:31:30,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:31:30,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:30,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:30,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:30,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,495 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:30,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:30,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:30,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_830]. (let ((.cse2 (select v_main_a_830 main_y))) (let ((.cse1 (= main_a (store v_main_a_830 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_830 main_x))) (or (and (= .cse0 2) .cse1 (= .cse2 999)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:31:30,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:30,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:30,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:30,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:30,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,624 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:30,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:30,625 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:30,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_831]. (let ((.cse0 (select v_main_a_831 main_x))) (let ((.cse1 (= main_a (store v_main_a_831 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_831 main_y) 998) (= .cse0 2) .cse1)))) [2019-05-15 10:31:30,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:31:30,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:30,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:30,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:30,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:30,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,717 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:30,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:30,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:30,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_832]. (let ((.cse2 (select v_main_a_832 main_y))) (let ((.cse1 (= main_a (store v_main_a_832 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_832 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 998) .cse1 (= .cse0 3))))) [2019-05-15 10:31:30,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:30,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:30,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:30,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:30,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,824 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:30,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:30,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:30,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_833]. (let ((.cse0 (select v_main_a_833 main_x))) (let ((.cse1 (= (store v_main_a_833 main_x (+ .cse0 1)) main_a))) (or (and (= 3 .cse0) (= (select v_main_a_833 main_y) 997) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:30,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:31:30,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:30,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:30,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:30,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:30,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:30,927 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:30,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:30,928 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:30,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:30,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_834]. (let ((.cse1 (select v_main_a_834 main_y))) (let ((.cse0 (= (store v_main_a_834 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_834 main_x))) (or (and .cse0 (= 997 .cse1) (= 4 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:31:30,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:31,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:31,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:31,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:31,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:31,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,058 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:31,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:31,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:31,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:31,071 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_835]. (let ((.cse0 (select v_main_a_835 main_x))) (let ((.cse1 (= (store v_main_a_835 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 996 (select v_main_a_835 main_y)) .cse1 (= 4 .cse0))))) [2019-05-15 10:31:31,071 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:31:31,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:31,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:31,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:31,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:31,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,199 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:31,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:31,199 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:31,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:31,256 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_836]. (let ((.cse0 (select v_main_a_836 main_y))) (let ((.cse1 (= (store v_main_a_836 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_836 main_x))) (or (and (= 996 .cse0) .cse1 (= .cse2 5)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:31:31,256 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:31,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:31,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:31,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:31,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:31,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,429 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:31,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:31,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:31,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:31,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_837]. (let ((.cse0 (select v_main_a_837 main_x))) (let ((.cse1 (= (store v_main_a_837 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 995 (select v_main_a_837 main_y)) (= .cse0 5) .cse1)))) [2019-05-15 10:31:31,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:31:31,537 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:31,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:31,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:31,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:31,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:31,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,595 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:31,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:31,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:31,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:31,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_838]. (let ((.cse2 (select v_main_a_838 main_y))) (let ((.cse1 (select v_main_a_838 main_x)) (.cse0 (= (store v_main_a_838 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 6) .cse0 (= .cse2 995))))) [2019-05-15 10:31:31,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:31,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:31,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:31,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,680 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:31,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:31,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,707 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:31,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:31,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:31,718 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:31,718 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_839]. (let ((.cse0 (select v_main_a_839 main_x))) (let ((.cse1 (= (store v_main_a_839 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 6) (= 994 (select v_main_a_839 main_y)) .cse1)))) [2019-05-15 10:31:31,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:31:31,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:31,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:31,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:31,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:31,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:31,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,811 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:31,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:31,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:31,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:31,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_840]. (let ((.cse2 (select v_main_a_840 main_y))) (let ((.cse0 (select v_main_a_840 main_x)) (.cse1 (= (store v_main_a_840 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 7) .cse1 (= .cse2 994))))) [2019-05-15 10:31:31,822 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:31:31,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:31,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:31,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:31,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:31,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:31,917 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:31,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:31,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:31,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:31,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_841]. (let ((.cse1 (select v_main_a_841 main_x))) (let ((.cse0 (= (store v_main_a_841 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 7) (= (select v_main_a_841 main_y) 993)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:31:31,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:31:31,979 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:31,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:31,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:31,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,026 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:32,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:32,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:32,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_842]. (let ((.cse2 (select v_main_a_842 main_y))) (let ((.cse1 (select v_main_a_842 main_x)) (.cse0 (= (store v_main_a_842 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 8) (= .cse2 993) .cse0)))) [2019-05-15 10:31:32,040 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:31:32,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:32,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:32,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,137 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:32,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:32,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:32,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,151 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_843]. (let ((.cse1 (select v_main_a_843 main_x))) (let ((.cse0 (= (store v_main_a_843 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 8 .cse1) (= 992 (select v_main_a_843 main_y)))))) [2019-05-15 10:31:32,151 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:31:32,203 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:32,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:32,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:32,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,225 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,251 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:32,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:32,252 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:32,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_844]. (let ((.cse2 (select v_main_a_844 main_y))) (let ((.cse0 (select v_main_a_844 main_x)) (.cse1 (= (store v_main_a_844 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 9 .cse0) (= 992 .cse2) .cse1)))) [2019-05-15 10:31:32,262 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:31:32,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:32,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:32,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,373 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:32,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:32,374 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:32,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_845]. (let ((.cse0 (select v_main_a_845 main_x))) (let ((.cse1 (= main_a (store v_main_a_845 main_x (+ .cse0 1))))) (or (and (= 9 .cse0) (= 991 (select v_main_a_845 main_y)) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:31:32,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:31:32,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:32,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:32,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:32,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,487 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:32,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:32,487 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:32,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_846]. (let ((.cse2 (select v_main_a_846 main_y))) (let ((.cse0 (= (store v_main_a_846 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_846 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 10 .cse1) (= 991 .cse2))))) [2019-05-15 10:31:32,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:32,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:32,601 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:32,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,634 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:32,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:32,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:32,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,651 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_847]. (let ((.cse0 (select v_main_a_847 main_x))) (let ((.cse1 (= (store v_main_a_847 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 10) (= (select v_main_a_847 main_y) 990) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:32,651 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:31:32,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:32,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:32,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,758 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:32,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:32,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:32,769 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_848]. (let ((.cse2 (select v_main_a_848 main_y))) (let ((.cse1 (= (store v_main_a_848 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_848 main_x))) (or (and (= 11 .cse0) .cse1 (= 990 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:31:32,769 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:31:32,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:32,845 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:32,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,877 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:32,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:32,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:32,889 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_849]. (let ((.cse1 (select v_main_a_849 main_x))) (let ((.cse0 (= (store v_main_a_849 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_849 main_y) 989) .cse0 (= 11 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:31:32,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:31:32,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:32,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:32,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:32,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,019 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:33,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:33,020 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:33,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_850]. (let ((.cse2 (select v_main_a_850 main_y))) (let ((.cse0 (= main_a (store v_main_a_850 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_850 main_x))) (or (and .cse0 (= 12 .cse1) (= .cse2 989)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:31:33,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:33,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:33,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:33,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:33,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,166 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:33,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:33,166 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:33,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_851]. (let ((.cse1 (select v_main_a_851 main_x))) (let ((.cse0 (= (store v_main_a_851 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 12) (= 988 (select v_main_a_851 main_y))) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:31:33,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:31:33,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:33,251 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:33,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:33,259 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,294 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:33,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:33,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:33,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_852]. (let ((.cse2 (select v_main_a_852 main_y))) (let ((.cse0 (= (store v_main_a_852 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_852 main_x))) (or (and .cse0 (= .cse1 13) (= 988 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:31:33,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:33,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:33,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:33,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:33,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,419 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:33,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:33,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:33,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_853]. (let ((.cse0 (select v_main_a_853 main_x))) (let ((.cse1 (= (store v_main_a_853 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_853 main_y) 987) (= 13 .cse0) .cse1)))) [2019-05-15 10:31:33,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:31:33,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:33,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:33,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:33,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,550 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:33,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:33,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:33,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_854]. (let ((.cse2 (select v_main_a_854 main_y))) (let ((.cse1 (select v_main_a_854 main_x)) (.cse0 (= main_a (store v_main_a_854 main_y (+ .cse2 (- 1)))))) (or (and .cse0 (= 14 .cse1) (= 987 .cse2)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:31:33,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:31:33,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:33,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:33,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:33,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,669 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:33,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:33,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:33,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_855]. (let ((.cse1 (select v_main_a_855 main_x))) (let ((.cse0 (= (store v_main_a_855 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_855 main_y) 986) (= 14 .cse1))))) [2019-05-15 10:31:33,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:31:33,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:33,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:33,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:33,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,795 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:33,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:33,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:33,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_856]. (let ((.cse0 (select v_main_a_856 main_y))) (let ((.cse1 (select v_main_a_856 main_x)) (.cse2 (= main_a (store v_main_a_856 main_y (+ .cse0 (- 1)))))) (or (and (= 986 .cse0) (= .cse1 15) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:31:33,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:33,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:33,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:33,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:33,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,933 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:33,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:33,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:33,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_857]. (let ((.cse0 (select v_main_a_857 main_x))) (let ((.cse1 (= (store v_main_a_857 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 15 .cse0) (= 985 (select v_main_a_857 main_y)) .cse1)))) [2019-05-15 10:31:33,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:31:34,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:34,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:34,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:34,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,068 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:34,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:34,069 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:34,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_858]. (let ((.cse2 (select v_main_a_858 main_y))) (let ((.cse1 (select v_main_a_858 main_x)) (.cse0 (= (store v_main_a_858 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 16 .cse1) (= 985 .cse2)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:31:34,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:34,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:34,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:34,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:34,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,228 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:34,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:34,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:34,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_859]. (let ((.cse0 (select v_main_a_859 main_x))) (let ((.cse1 (= (store v_main_a_859 main_x (+ .cse0 1)) main_a))) (or (and (= 16 .cse0) (= 984 (select v_main_a_859 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:34,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:31:34,340 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:34,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:34,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:34,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:34,364 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,387 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:34,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:34,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:34,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,399 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_860]. (let ((.cse2 (select v_main_a_860 main_y))) (let ((.cse1 (= (store v_main_a_860 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_860 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 984 .cse2) .cse1 (= 17 .cse0))))) [2019-05-15 10:31:34,399 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:31:34,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:34,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:34,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:34,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,521 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:34,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:34,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:34,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_861]. (let ((.cse0 (select v_main_a_861 main_x))) (let ((.cse1 (= (store v_main_a_861 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_861 main_y) 983) (= 17 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:34,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:31:34,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:34,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:34,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:34,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:34,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,667 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:34,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:34,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:34,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_862]. (let ((.cse2 (select v_main_a_862 main_y))) (let ((.cse1 (= (store v_main_a_862 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_862 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 983) (= .cse0 18))))) [2019-05-15 10:31:34,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:34,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:34,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:34,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:34,824 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,851 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:34,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:34,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:34,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_863]. (let ((.cse0 (select v_main_a_863 main_x))) (let ((.cse1 (= main_a (store v_main_a_863 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 18 .cse0) .cse1 (= (select v_main_a_863 main_y) 982))))) [2019-05-15 10:31:34,863 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:31:34,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:34,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:34,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:34,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,992 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:34,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:34,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:35,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_864]. (let ((.cse2 (select v_main_a_864 main_y))) (let ((.cse1 (= main_a (store v_main_a_864 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_864 main_x))) (or (and (= .cse0 19) .cse1 (= 982 .cse2)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:31:35,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:31:35,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:35,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:35,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:35,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,134 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:35,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:35,135 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:35,147 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_865]. (let ((.cse0 (select v_main_a_865 main_x))) (let ((.cse1 (= (store v_main_a_865 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_865 main_y) 981) (= .cse0 19) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:35,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:31:35,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:35,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:35,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:35,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,286 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:35,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:35,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:35,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_866]. (let ((.cse0 (select v_main_a_866 main_y))) (let ((.cse2 (= (store v_main_a_866 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_866 main_x))) (or (and (= 981 .cse0) (= 20 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:31:35,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:35,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:35,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:35,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:35,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,907 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:31:35,907 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:35,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:35,908 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:35,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_867]. (let ((.cse1 (select v_main_a_867 main_x))) (let ((.cse0 (= (store v_main_a_867 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 20 .cse1) (= (select v_main_a_867 main_y) 980)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:31:35,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:31:37,226 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-15 10:31:37,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:37,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:37,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:37,578 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,603 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:37,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:37,604 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:37,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_868]. (let ((.cse0 (select v_main_a_868 main_y))) (let ((.cse2 (select v_main_a_868 main_x)) (.cse1 (= main_a (store v_main_a_868 main_y (+ .cse0 (- 1)))))) (or (and (= 980 .cse0) .cse1 (= .cse2 21)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:31:37,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:37,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:37,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:37,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:37,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,765 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:37,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:37,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:37,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_869]. (let ((.cse0 (select v_main_a_869 main_x))) (let ((.cse1 (= (store v_main_a_869 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 979 (select v_main_a_869 main_y)) .cse1 (= 21 .cse0))))) [2019-05-15 10:31:37,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:31:38,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:38,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:38,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:38,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:38,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,090 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:38,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:38,090 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:38,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:38,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_870]. (let ((.cse0 (select v_main_a_870 main_y))) (let ((.cse1 (select v_main_a_870 main_x)) (.cse2 (= (store v_main_a_870 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 979 .cse0) (= 22 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:31:38,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:31:38,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:38,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:38,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:38,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:38,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,236 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:38,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:38,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:38,248 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:38,248 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_871]. (let ((.cse0 (select v_main_a_871 main_x))) (let ((.cse1 (= (store v_main_a_871 main_x (+ .cse0 1)) main_a))) (or (and (= 22 .cse0) (= 978 (select v_main_a_871 main_y)) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:31:38,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:31:38,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:38,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:38,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:38,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:38,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,395 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:38,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:38,396 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:38,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:38,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_872]. (let ((.cse1 (select v_main_a_872 main_y))) (let ((.cse2 (= (store v_main_a_872 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_872 main_x))) (or (and (= 23 .cse0) (= 978 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse0))))) [2019-05-15 10:31:38,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:38,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:38,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:38,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:38,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:38,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,630 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:38,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:38,631 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:38,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:38,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_873]. (let ((.cse0 (select v_main_a_873 main_x))) (let ((.cse1 (= (store v_main_a_873 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 977 (select v_main_a_873 main_y)) .cse1 (= 23 .cse0))))) [2019-05-15 10:31:38,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:31:38,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:38,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:38,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:38,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:38,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,779 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:38,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:38,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:38,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:38,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_874]. (let ((.cse1 (select v_main_a_874 main_y))) (let ((.cse0 (select v_main_a_874 main_x)) (.cse2 (= main_a (store v_main_a_874 main_y (+ .cse1 (- 1)))))) (or (and (= 24 .cse0) (= .cse1 977) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:31:38,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:38,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:38,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:38,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:38,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:38,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:38,997 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:38,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:38,998 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:39,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:39,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_875]. (let ((.cse1 (select v_main_a_875 main_x))) (let ((.cse0 (= (store v_main_a_875 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 24) .cse0 (= (select v_main_a_875 main_y) 976))))) [2019-05-15 10:31:39,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:31:39,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:39,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:39,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:39,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:39,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,152 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:39,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:39,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:39,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:39,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_876]. (let ((.cse1 (select v_main_a_876 main_y))) (let ((.cse0 (= (store v_main_a_876 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_876 main_x))) (or (and .cse0 (= .cse1 976) (= .cse2 25)) (and .cse0 (= main_y main_x) (= .cse2 1001))))) [2019-05-15 10:31:39,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:39,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:39,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:39,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:39,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:39,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,397 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:39,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:39,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:39,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:39,411 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_877]. (let ((.cse0 (select v_main_a_877 main_x))) (let ((.cse1 (= (store v_main_a_877 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 25) (= (select v_main_a_877 main_y) 975) .cse1)))) [2019-05-15 10:31:39,411 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:31:39,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:39,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:39,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:39,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:39,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:39,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,558 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:39,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:39,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:39,612 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:39,612 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_878]. (let ((.cse2 (select v_main_a_878 main_y))) (let ((.cse0 (= (store v_main_a_878 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_878 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 975 .cse2) .cse0 (= 26 .cse1))))) [2019-05-15 10:31:39,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:39,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:39,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:39,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:39,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:39,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,747 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:39,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:39,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:39,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:39,764 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_879]. (let ((.cse1 (select v_main_a_879 main_x))) (let ((.cse0 (= main_a (store v_main_a_879 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 974 (select v_main_a_879 main_y)) (= 26 .cse1))))) [2019-05-15 10:31:39,764 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:31:39,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:39,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:39,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:39,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:39,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:39,903 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:39,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:39,904 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:39,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:39,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_880]. (let ((.cse1 (select v_main_a_880 main_y))) (let ((.cse0 (select v_main_a_880 main_x)) (.cse2 (= (store v_main_a_880 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 27 .cse0) (= 974 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:31:39,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:40,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:40,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:40,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:40,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:40,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:40,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:40,073 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:40,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:40,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:40,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:40,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_881]. (let ((.cse0 (select v_main_a_881 main_x))) (let ((.cse1 (= (store v_main_a_881 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 27) (= (select v_main_a_881 main_y) 973) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:31:40,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:31:40,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:40,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:40,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:40,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:40,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:40,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:40,226 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:40,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:40,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:40,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:40,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_882]. (let ((.cse0 (select v_main_a_882 main_y))) (let ((.cse2 (select v_main_a_882 main_x)) (.cse1 (= (store v_main_a_882 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 973) .cse1 (= .cse2 28)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:31:40,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:40,370 INFO L273 TraceCheckUtils]: 0: Hoare triple {7267#true} a := a[x := 0]; {7272#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:31:40,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {7272#(= (select main_a main_x) 0)} a := a[y := 1000]; {7276#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:31:40,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {7276#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {7280#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:31:40,373 INFO L273 TraceCheckUtils]: 3: Hoare triple {7280#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {7284#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,374 INFO L273 TraceCheckUtils]: 4: Hoare triple {7284#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7288#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:31:40,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {7288#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {7292#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {7292#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7296#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:31:40,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {7296#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {7300#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {7300#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7304#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:31:40,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {7304#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {7308#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {7308#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7312#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:31:40,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {7312#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {7316#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {7316#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7320#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:31:40,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {7320#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {7324#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:31:40,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {7324#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {7328#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:31:40,387 INFO L273 TraceCheckUtils]: 15: Hoare triple {7328#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {7332#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:31:40,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {7332#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {7336#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:31:40,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {7336#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {7340#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:31:40,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {7340#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {7344#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:31:40,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {7344#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {7348#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {7348#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7352#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:31:40,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {7352#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {7356#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {7356#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7360#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:31:40,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {7360#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {7364#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:31:40,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {7364#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {7368#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:31:40,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {7368#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {7372#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {7372#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7376#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:31:40,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {7376#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {7380#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {7380#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7384#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:31:40,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {7384#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {7388#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:31:40,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {7388#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {7392#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:31:40,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {7392#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {7396#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {7396#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7400#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:31:40,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {7400#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {7404#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {7404#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7408#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:31:40,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {7408#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {7412#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:31:40,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {7412#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {7416#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:31:40,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {7416#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {7420#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,413 INFO L273 TraceCheckUtils]: 38: Hoare triple {7420#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7424#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:31:40,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {7424#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {7428#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:31:40,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {7428#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {7432#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:31:40,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {7432#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {7436#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,417 INFO L273 TraceCheckUtils]: 42: Hoare triple {7436#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7440#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:31:40,419 INFO L273 TraceCheckUtils]: 43: Hoare triple {7440#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {7444#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {7444#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7448#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:31:40,421 INFO L273 TraceCheckUtils]: 45: Hoare triple {7448#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {7452#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:31:40,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {7452#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {7456#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:31:40,423 INFO L273 TraceCheckUtils]: 47: Hoare triple {7456#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {7460#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,424 INFO L273 TraceCheckUtils]: 48: Hoare triple {7460#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7464#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:31:40,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {7464#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {7468#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {7468#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7472#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:31:40,428 INFO L273 TraceCheckUtils]: 51: Hoare triple {7472#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {7476#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,429 INFO L273 TraceCheckUtils]: 52: Hoare triple {7476#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7480#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:31:40,431 INFO L273 TraceCheckUtils]: 53: Hoare triple {7480#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {7484#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,432 INFO L273 TraceCheckUtils]: 54: Hoare triple {7484#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7488#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:31:40,433 INFO L273 TraceCheckUtils]: 55: Hoare triple {7488#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {7492#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,434 INFO L273 TraceCheckUtils]: 56: Hoare triple {7492#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7496#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:31:40,435 INFO L273 TraceCheckUtils]: 57: Hoare triple {7496#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {7500#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:40,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {7500#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {7268#false} is VALID [2019-05-15 10:31:40,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {7268#false} assume !(a[y] <= 0); {7268#false} is VALID [2019-05-15 10:31:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-15 10:31:40,455 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-05-15 10:31:40,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:40,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2019-05-15 10:31:40,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:40,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-05-15 10:31:40,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-15 10:31:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-05-15 10:31:40,536 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-05-15 10:31:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:49,602 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:31:49,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-15 10:31:49,602 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-05-15 10:31:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-05-15 10:31:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-05-15 10:31:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-05-15 10:31:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-05-15 10:31:49,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2019-05-15 10:31:49,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:49,772 INFO L225 Difference]: With dead ends: 63 [2019-05-15 10:31:49,772 INFO L226 Difference]: Without dead ends: 63 [2019-05-15 10:31:49,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-05-15 10:31:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-05-15 10:31:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-05-15 10:31:49,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:49,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2019-05-15 10:31:49,775 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2019-05-15 10:31:49,775 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2019-05-15 10:31:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:49,776 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:31:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:31:49,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:49,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:49,777 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2019-05-15 10:31:49,777 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2019-05-15 10:31:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:49,777 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:31:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:31:49,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:49,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:49,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:49,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-05-15 10:31:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-05-15 10:31:49,779 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-05-15 10:31:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:49,779 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-05-15 10:31:49,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-05-15 10:31:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:31:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-05-15 10:31:49,780 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:49,780 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-05-15 10:31:49,780 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash -676274304, now seen corresponding path program 29 times [2019-05-15 10:31:49,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:49,852 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-15 10:31:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:49,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:49,978 INFO L375 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 6 treesize of output 5 [2019-05-15 10:31:49,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:50,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_883]. (= (store v_main_a_883 main_x 0) main_a) [2019-05-15 10:31:50,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:31:50,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:31:50,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,126 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:31:50,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:31:50,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_884]. (and (= (select v_main_a_884 main_x) 0) (= (store v_main_a_884 main_y 1000) main_a)) [2019-05-15 10:31:50,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:31:50,154 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:50,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:50,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:50,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:50,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,202 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:50,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:50,202 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:50,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_885]. (let ((.cse2 (select v_main_a_885 main_x))) (let ((.cse0 (= (store v_main_a_885 main_x (+ .cse2 1)) main_a)) (.cse1 (= 1000 (select v_main_a_885 main_y)))) (or (and (= main_y main_x) .cse0 .cse1) (and (= .cse2 0) .cse0 .cse1)))) [2019-05-15 10:31:50,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:31:50,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:50,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:50,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:50,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,292 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:50,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:50,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:50,332 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,332 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_886]. (let ((.cse2 (select v_main_a_886 main_y))) (let ((.cse1 (select v_main_a_886 main_x)) (.cse0 (= (store v_main_a_886 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= .cse1 1) (= .cse2 1000)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:31:50,332 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:50,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:50,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:50,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:50,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,423 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:50,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:50,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:50,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_887]. (let ((.cse0 (select v_main_a_887 main_x))) (let ((.cse1 (= (store v_main_a_887 main_x (+ .cse0 1)) main_a))) (or (and (= 1 .cse0) (= 999 (select v_main_a_887 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:50,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:31:50,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:50,485 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:50,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:50,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,527 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:50,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:50,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:50,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_888]. (let ((.cse1 (select v_main_a_888 main_y))) (let ((.cse0 (= (store v_main_a_888 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_888 main_x))) (or (and .cse0 (= .cse1 999) (= .cse2 2)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:31:50,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:50,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:50,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:50,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:50,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,671 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:50,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:50,672 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:50,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_889]. (let ((.cse0 (select v_main_a_889 main_x))) (let ((.cse1 (= (store v_main_a_889 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 998 (select v_main_a_889 main_y)) (= 2 .cse0) .cse1)))) [2019-05-15 10:31:50,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:31:50,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:50,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:50,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:50,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,780 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:50,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:50,781 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:50,806 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,807 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_890]. (let ((.cse2 (select v_main_a_890 main_y))) (let ((.cse1 (= (store v_main_a_890 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_890 main_x))) (or (and (= 3 .cse0) .cse1 (= .cse2 998)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:31:50,807 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:50,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:50,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:50,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:50,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,895 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:50,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:50,895 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:50,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:50,904 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_891]. (let ((.cse1 (select v_main_a_891 main_x))) (let ((.cse0 (= (store v_main_a_891 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_891 main_y) 997) .cse0 (= 3 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:31:50,904 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:31:50,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:50,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:50,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:50,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:50,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:50,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:50,989 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:50,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:50,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:51,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:51,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_892]. (let ((.cse2 (select v_main_a_892 main_y))) (let ((.cse0 (= (store v_main_a_892 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_892 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= .cse2 997) .cse0 (= 4 .cse1))))) [2019-05-15 10:31:51,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:51,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:51,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:51,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:51,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:51,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,118 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:51,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:51,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:51,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:51,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_893]. (let ((.cse0 (select v_main_a_893 main_x))) (let ((.cse1 (= (store v_main_a_893 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 4) .cse1 (= 996 (select v_main_a_893 main_y))) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:31:51,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:31:51,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:51,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:51,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:51,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,194 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:51,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:51,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,220 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:51,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:51,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:51,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:51,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_894]. (let ((.cse2 (select v_main_a_894 main_y))) (let ((.cse0 (select v_main_a_894 main_x)) (.cse1 (= (store v_main_a_894 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 5) .cse1 (= 996 .cse2))))) [2019-05-15 10:31:51,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:51,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:51,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:51,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:51,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:51,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,356 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:51,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:51,357 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:51,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:51,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_895]. (let ((.cse0 (select v_main_a_895 main_x))) (let ((.cse1 (= (store v_main_a_895 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 5) (= (select v_main_a_895 main_y) 995) .cse1)))) [2019-05-15 10:31:51,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:31:51,413 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:51,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:51,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:51,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:51,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:51,437 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,472 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:51,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:51,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:51,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:51,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_896]. (let ((.cse2 (select v_main_a_896 main_y))) (let ((.cse1 (select v_main_a_896 main_x)) (.cse0 (= (store v_main_a_896 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 6) .cse0 (= 995 .cse2))))) [2019-05-15 10:31:51,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:51,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:51,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:51,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:51,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:51,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,595 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:51,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:51,595 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:51,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:51,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_897]. (let ((.cse1 (select v_main_a_897 main_x))) (let ((.cse0 (= (store v_main_a_897 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 6 .cse1) (= (select v_main_a_897 main_y) 994)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:31:51,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:31:51,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:51,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:51,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:51,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,762 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:51,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:51,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,804 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:51,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:51,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:51,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:51,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_898]. (let ((.cse2 (select v_main_a_898 main_y))) (let ((.cse0 (select v_main_a_898 main_x)) (.cse1 (= (store v_main_a_898 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 7) .cse1 (= 994 .cse2))))) [2019-05-15 10:31:51,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:31:51,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:51,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:51,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:51,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:51,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:51,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,000 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,001 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_899]. (let ((.cse1 (select v_main_a_899 main_x))) (let ((.cse0 (= (store v_main_a_899 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_899 main_y) 993) .cse0 (= 7 .cse1))))) [2019-05-15 10:31:52,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:31:52,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:52,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:52,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:52,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,113 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_900]. (let ((.cse2 (select v_main_a_900 main_y))) (let ((.cse1 (select v_main_a_900 main_x)) (.cse0 (= (store v_main_a_900 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 8 .cse1) (= .cse2 993)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:31:52,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:52,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:52,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:52,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:52,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,234 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,248 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_901]. (let ((.cse1 (select v_main_a_901 main_x))) (let ((.cse0 (= main_a (store v_main_a_901 main_x (+ .cse1 1))))) (or (and .cse0 (= 992 (select v_main_a_901 main_y)) (= .cse1 8)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:31:52,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:31:52,297 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:52,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:52,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:52,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:52,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,345 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_902]. (let ((.cse2 (select v_main_a_902 main_y))) (let ((.cse0 (select v_main_a_902 main_x)) (.cse1 (= (store v_main_a_902 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 9) (= .cse2 992) .cse1)))) [2019-05-15 10:31:52,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:31:52,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:52,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:52,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:52,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,472 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,481 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_903]. (let ((.cse1 (select v_main_a_903 main_x))) (let ((.cse0 (= main_a (store v_main_a_903 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 9) (= (select v_main_a_903 main_y) 991)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:31:52,481 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:31:52,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:52,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:52,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:52,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,584 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_904]. (let ((.cse2 (select v_main_a_904 main_y))) (let ((.cse1 (= main_a (store v_main_a_904 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_904 main_x))) (or (and (= .cse0 10) .cse1 (= .cse2 991)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:31:52,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:52,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:52,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:52,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:52,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,731 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_905]. (let ((.cse1 (select v_main_a_905 main_x))) (let ((.cse0 (= main_a (store v_main_a_905 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 10 .cse1) .cse0 (= (select v_main_a_905 main_y) 990))))) [2019-05-15 10:31:52,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:31:52,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:52,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:52,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:52,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,848 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,848 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_906]. (let ((.cse2 (select v_main_a_906 main_y))) (let ((.cse0 (= (store v_main_a_906 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_906 main_x))) (or (and .cse0 (= .cse1 11) (= .cse2 990)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:31:52,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:31:52,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:52,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:52,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:52,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,964 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:52,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:52,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:52,978 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,978 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_907]. (let ((.cse0 (select v_main_a_907 main_x))) (let ((.cse1 (= (store v_main_a_907 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 11) (= (select v_main_a_907 main_y) 989) .cse1)))) [2019-05-15 10:31:52,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:31:53,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:53,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:53,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:53,067 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,092 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:53,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:53,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:53,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_908]. (let ((.cse2 (select v_main_a_908 main_y))) (let ((.cse0 (= main_a (store v_main_a_908 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_908 main_x))) (or (and .cse0 (= 12 .cse1) (= 989 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:31:53,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:53,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:53,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:53,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:53,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,265 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:53,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:53,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:53,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_909]. (let ((.cse0 (select v_main_a_909 main_x))) (let ((.cse1 (= (store v_main_a_909 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 12) (= 988 (select v_main_a_909 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:53,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:31:53,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:53,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:53,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:53,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,404 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:53,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:53,404 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:53,437 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,437 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_910]. (let ((.cse1 (select v_main_a_910 main_y))) (let ((.cse0 (select v_main_a_910 main_x)) (.cse2 (= (store v_main_a_910 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 13) (= .cse1 988) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:31:53,437 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:53,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:53,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:53,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,525 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:53,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,563 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:53,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:53,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:53,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,574 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_911]. (let ((.cse0 (select v_main_a_911 main_x))) (let ((.cse1 (= (store v_main_a_911 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_911 main_y) 987) (= .cse0 13) .cse1)))) [2019-05-15 10:31:53,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:31:53,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:53,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:53,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:53,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:53,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,699 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:53,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:53,700 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:53,710 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,710 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_912]. (let ((.cse2 (select v_main_a_912 main_y))) (let ((.cse0 (select v_main_a_912 main_x)) (.cse1 (= (store v_main_a_912 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 987 .cse2) (= 14 .cse0) .cse1)))) [2019-05-15 10:31:53,710 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:31:53,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:53,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:53,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,796 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:53,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,824 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:53,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:53,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:53,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_913]. (let ((.cse1 (select v_main_a_913 main_x))) (let ((.cse0 (= (store v_main_a_913 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 14) (= 986 (select v_main_a_913 main_y)))))) [2019-05-15 10:31:53,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:31:53,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:53,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:53,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:53,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,956 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:53,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:53,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:53,982 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,982 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_914]. (let ((.cse0 (select v_main_a_914 main_y))) (let ((.cse1 (select v_main_a_914 main_x)) (.cse2 (= (store v_main_a_914 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 986) (= 15 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:31:53,982 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:54,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:54,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:54,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:54,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,106 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:54,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:54,106 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:54,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_915]. (let ((.cse1 (select v_main_a_915 main_x))) (let ((.cse0 (= (store v_main_a_915 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 15) (= (select v_main_a_915 main_y) 985)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:31:54,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:31:54,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:54,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:54,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:54,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,258 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:54,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:54,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:54,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_916]. (let ((.cse0 (select v_main_a_916 main_y))) (let ((.cse2 (select v_main_a_916 main_x)) (.cse1 (= (store v_main_a_916 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 985) .cse1 (= .cse2 16)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:31:54,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:54,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:54,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:54,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:54,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,404 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:54,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:54,404 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:54,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_917]. (let ((.cse1 (select v_main_a_917 main_x))) (let ((.cse0 (= (store v_main_a_917 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_917 main_y) 984) (= .cse1 16)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:31:54,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:31:54,486 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:54,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:54,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:54,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:54,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,535 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:54,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:54,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:54,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_918]. (let ((.cse2 (select v_main_a_918 main_y))) (let ((.cse0 (= (store v_main_a_918 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_918 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 17) (= .cse2 984))))) [2019-05-15 10:31:54,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:31:54,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:54,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:54,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,676 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:54,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,704 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:54,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:54,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:54,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_919]. (let ((.cse0 (select v_main_a_919 main_x))) (let ((.cse1 (= (store v_main_a_919 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 17) (= (select v_main_a_919 main_y) 983))))) [2019-05-15 10:31:54,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:31:54,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:54,807 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:54,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:54,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,853 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:54,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:54,853 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:54,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,904 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_920]. (let ((.cse2 (select v_main_a_920 main_y))) (let ((.cse0 (select v_main_a_920 main_x)) (.cse1 (= (store v_main_a_920 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 18 .cse0) .cse1 (= 983 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:31:54,904 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:54,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:54,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:54,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:54,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,024 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:55,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:55,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:55,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_921]. (let ((.cse0 (select v_main_a_921 main_x))) (let ((.cse1 (= (store v_main_a_921 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 982 (select v_main_a_921 main_y)) .cse1 (= 18 .cse0))))) [2019-05-15 10:31:55,035 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:31:55,106 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:55,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:55,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:55,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:55,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,156 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:55,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:55,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:55,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_922]. (let ((.cse2 (select v_main_a_922 main_y))) (let ((.cse1 (= (store v_main_a_922 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_922 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= .cse2 982) (= 19 .cse0))))) [2019-05-15 10:31:55,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:31:55,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:55,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:55,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:55,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,291 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:55,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:55,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:55,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_923]. (let ((.cse0 (select v_main_a_923 main_x))) (let ((.cse1 (= main_a (store v_main_a_923 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 981 (select v_main_a_923 main_y)) .cse1 (= 19 .cse0))))) [2019-05-15 10:31:55,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:31:55,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:55,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:55,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:55,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,445 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:55,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:55,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:55,533 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_924]. (let ((.cse1 (select v_main_a_924 main_y))) (let ((.cse0 (= main_a (store v_main_a_924 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_924 main_x))) (or (and .cse0 (= .cse1 981) (= 20 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse2))))) [2019-05-15 10:31:55,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:55,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:55,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:55,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:55,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,660 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:55,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:55,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:55,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_925]. (let ((.cse0 (select v_main_a_925 main_x))) (let ((.cse1 (= main_a (store v_main_a_925 main_x (+ .cse0 1))))) (or (and (= 980 (select v_main_a_925 main_y)) (= 20 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:55,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:31:55,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:55,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:55,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:55,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:55,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,795 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:55,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:55,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:55,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_926]. (let ((.cse2 (select v_main_a_926 main_y))) (let ((.cse0 (select v_main_a_926 main_x)) (.cse1 (= (store v_main_a_926 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 21) (= 980 .cse2) .cse1)))) [2019-05-15 10:31:55,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:55,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:55,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:55,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:55,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,006 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:56,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:56,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:56,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_927]. (let ((.cse0 (select v_main_a_927 main_x))) (let ((.cse1 (= (store v_main_a_927 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_927 main_y) 979) (= 21 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:31:56,018 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:31:56,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:56,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:56,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:56,130 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,166 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:56,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:56,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:56,185 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_928]. (let ((.cse0 (select v_main_a_928 main_y))) (let ((.cse1 (= (store v_main_a_928 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_928 main_x))) (or (and (= .cse0 979) .cse1 (= 22 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:31:56,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:31:56,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:56,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:56,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:56,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,363 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:56,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:56,364 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:56,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_929]. (let ((.cse1 (select v_main_a_929 main_x))) (let ((.cse0 (= (store v_main_a_929 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 22 .cse1) (= (select v_main_a_929 main_y) 978)) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:31:56,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:31:56,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:56,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:56,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:56,486 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,522 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:56,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:56,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:56,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_930]. (let ((.cse2 (select v_main_a_930 main_y))) (let ((.cse0 (select v_main_a_930 main_x)) (.cse1 (= (store v_main_a_930 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 23 .cse0) .cse1 (= .cse2 978)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:31:56,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:56,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:56,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:56,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:56,667 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,692 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:56,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:56,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:56,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_931]. (let ((.cse0 (select v_main_a_931 main_x))) (let ((.cse1 (= (store v_main_a_931 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 23) .cse1 (= 977 (select v_main_a_931 main_y))) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:31:56,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:31:56,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:56,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:56,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:56,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,938 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:56,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:56,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:56,982 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,982 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_932]. (let ((.cse2 (select v_main_a_932 main_y))) (let ((.cse1 (select v_main_a_932 main_x)) (.cse0 (= (store v_main_a_932 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 24 .cse1) (= .cse2 977)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:31:56,982 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:57,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:57,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:57,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:57,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,182 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:57,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:57,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:57,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_933]. (let ((.cse0 (select v_main_a_933 main_x))) (let ((.cse1 (= (store v_main_a_933 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 24) (= 976 (select v_main_a_933 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:57,195 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:31:57,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:57,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:57,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:57,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:57,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,335 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:57,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:57,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:57,434 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,434 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_934]. (let ((.cse2 (select v_main_a_934 main_y))) (let ((.cse0 (= (store v_main_a_934 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_934 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 976) (= 25 .cse1))))) [2019-05-15 10:31:57,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:57,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:57,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:57,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,542 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:57,544 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,567 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:57,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:57,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:57,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_935]. (let ((.cse1 (select v_main_a_935 main_x))) (let ((.cse0 (= (store v_main_a_935 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 975 (select v_main_a_935 main_y)) .cse0 (= 25 .cse1))))) [2019-05-15 10:31:57,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:31:57,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:57,682 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:57,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:57,691 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,727 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:57,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:57,728 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:57,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_936]. (let ((.cse0 (select v_main_a_936 main_y))) (let ((.cse1 (select v_main_a_936 main_x)) (.cse2 (= main_a (store v_main_a_936 main_y (+ .cse0 (- 1)))))) (or (and (= 975 .cse0) (= 26 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:31:57,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:57,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:57,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:57,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:57,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,928 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:57,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:57,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:57,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_937]. (let ((.cse0 (select v_main_a_937 main_x))) (let ((.cse1 (= main_a (store v_main_a_937 main_x (+ .cse0 1))))) (or (and (= .cse0 26) (= (select v_main_a_937 main_y) 974) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:31:57,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:31:58,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:58,049 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:58,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:58,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:58,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,106 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:58,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:58,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:58,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:58,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_938]. (let ((.cse0 (select v_main_a_938 main_y))) (let ((.cse1 (= (store v_main_a_938 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_938 main_x))) (or (and (= 974 .cse0) .cse1 (= .cse2 27)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:31:58,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:58,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:58,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:58,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:58,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:58,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,344 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:58,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:58,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:58,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:58,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_939]. (let ((.cse1 (select v_main_a_939 main_x))) (let ((.cse0 (= (store v_main_a_939 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 973 (select v_main_a_939 main_y)) (= .cse1 27) .cse0)))) [2019-05-15 10:31:58,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:31:58,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:58,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:58,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:58,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,473 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:58,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:58,475 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,500 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:58,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:58,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:58,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:58,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_940]. (let ((.cse2 (select v_main_a_940 main_y))) (let ((.cse1 (select v_main_a_940 main_x)) (.cse0 (= (store v_main_a_940 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 28) .cse0 (= 973 .cse2))))) [2019-05-15 10:31:58,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:58,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:58,680 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:58,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:58,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:31:58,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,712 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:58,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:58,712 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:58,725 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:58,725 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_941]. (let ((.cse0 (select v_main_a_941 main_x))) (let ((.cse1 (= (store v_main_a_941 main_x (+ .cse0 1)) main_a))) (or (and (= 28 .cse0) (= 972 (select v_main_a_941 main_y)) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:31:58,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:31:58,842 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:31:58,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:31:58,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:31:58,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:58,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:31:58,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:58,889 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:31:58,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:31:58,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:31:58,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:58,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_942]. (let ((.cse2 (select v_main_a_942 main_y))) (let ((.cse0 (= (store v_main_a_942 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_942 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 972) (= 29 .cse1))))) [2019-05-15 10:31:58,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:31:59,021 INFO L273 TraceCheckUtils]: 0: Hoare triple {7758#true} a := a[x := 0]; {7763#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:31:59,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {7763#(= (select main_a main_x) 0)} a := a[y := 1000]; {7767#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:31:59,023 INFO L273 TraceCheckUtils]: 2: Hoare triple {7767#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {7771#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:31:59,024 INFO L273 TraceCheckUtils]: 3: Hoare triple {7771#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {7775#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,025 INFO L273 TraceCheckUtils]: 4: Hoare triple {7775#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7779#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:31:59,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {7779#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {7783#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {7783#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7787#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:31:59,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {7787#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {7791#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {7791#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7795#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:31:59,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {7795#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {7799#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {7799#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7803#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:31:59,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {7803#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {7807#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7811#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:31:59,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {7811#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {7815#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:31:59,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {7815#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {7819#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:31:59,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {7819#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {7823#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:31:59,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {7823#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {7827#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:31:59,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {7827#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {7831#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:31:59,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {7831#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {7835#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:31:59,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {7835#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {7839#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {7839#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7843#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:31:59,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {7843#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {7847#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {7847#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7851#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:31:59,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {7851#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {7855#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:31:59,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {7855#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {7859#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:31:59,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {7859#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {7863#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {7863#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7867#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:31:59,052 INFO L273 TraceCheckUtils]: 27: Hoare triple {7867#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {7871#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {7871#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7875#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:31:59,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {7875#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {7879#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:31:59,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {7879#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {7883#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:31:59,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {7883#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {7887#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {7887#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7891#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:31:59,059 INFO L273 TraceCheckUtils]: 33: Hoare triple {7891#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {7895#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,060 INFO L273 TraceCheckUtils]: 34: Hoare triple {7895#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7899#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:31:59,061 INFO L273 TraceCheckUtils]: 35: Hoare triple {7899#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {7903#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:31:59,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {7903#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {7907#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:31:59,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {7907#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {7911#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,064 INFO L273 TraceCheckUtils]: 38: Hoare triple {7911#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7915#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:31:59,065 INFO L273 TraceCheckUtils]: 39: Hoare triple {7915#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {7919#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:31:59,066 INFO L273 TraceCheckUtils]: 40: Hoare triple {7919#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {7923#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:31:59,068 INFO L273 TraceCheckUtils]: 41: Hoare triple {7923#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {7927#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {7927#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7931#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:31:59,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {7931#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {7935#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {7935#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7939#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:31:59,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {7939#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {7943#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:31:59,073 INFO L273 TraceCheckUtils]: 46: Hoare triple {7943#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {7947#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:31:59,074 INFO L273 TraceCheckUtils]: 47: Hoare triple {7947#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {7951#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,076 INFO L273 TraceCheckUtils]: 48: Hoare triple {7951#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7955#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:31:59,077 INFO L273 TraceCheckUtils]: 49: Hoare triple {7955#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {7959#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,078 INFO L273 TraceCheckUtils]: 50: Hoare triple {7959#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7963#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:31:59,079 INFO L273 TraceCheckUtils]: 51: Hoare triple {7963#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {7967#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,080 INFO L273 TraceCheckUtils]: 52: Hoare triple {7967#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7971#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:31:59,081 INFO L273 TraceCheckUtils]: 53: Hoare triple {7971#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {7975#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,082 INFO L273 TraceCheckUtils]: 54: Hoare triple {7975#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7979#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:31:59,084 INFO L273 TraceCheckUtils]: 55: Hoare triple {7979#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {7983#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {7983#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7987#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:31:59,086 INFO L273 TraceCheckUtils]: 57: Hoare triple {7987#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {7991#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,087 INFO L273 TraceCheckUtils]: 58: Hoare triple {7991#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {7995#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:31:59,088 INFO L273 TraceCheckUtils]: 59: Hoare triple {7995#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {7999#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:31:59,089 INFO L273 TraceCheckUtils]: 60: Hoare triple {7999#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {7759#false} is VALID [2019-05-15 10:31:59,089 INFO L273 TraceCheckUtils]: 61: Hoare triple {7759#false} assume !(a[y] <= 0); {7759#false} is VALID [2019-05-15 10:31:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:59,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:59,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-15 10:31:59,105 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-05-15 10:31:59,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:59,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2019-05-15 10:31:59,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:59,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-05-15 10:31:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-15 10:31:59,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-05-15 10:31:59,196 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-05-15 10:32:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:08,853 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:08,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-15 10:32:08,853 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-05-15 10:32:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:32:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-05-15 10:32:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:32:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-05-15 10:32:08,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2019-05-15 10:32:08,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:08,937 INFO L225 Difference]: With dead ends: 65 [2019-05-15 10:32:08,937 INFO L226 Difference]: Without dead ends: 65 [2019-05-15 10:32:08,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-05-15 10:32:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-05-15 10:32:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-05-15 10:32:08,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:08,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:08,939 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:08,939 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:08,940 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:08,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:08,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:08,940 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:08,940 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:08,941 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:08,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:08,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:08,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:08,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-05-15 10:32:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-05-15 10:32:08,942 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-05-15 10:32:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:08,943 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-05-15 10:32:08,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-05-15 10:32:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-05-15 10:32:08,943 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:08,944 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-05-15 10:32:08,944 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1359697887, now seen corresponding path program 30 times [2019-05-15 10:32:08,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:09,017 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-15 10:32:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:09,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:09,124 INFO L375 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 6 treesize of output 5 [2019-05-15 10:32:09,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:09,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:09,175 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:09,175 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_943]. (= (store v_main_a_943 main_x 0) main_a) [2019-05-15 10:32:09,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:32:09,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:09,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:32:09,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,326 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:32:09,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:32:09,330 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:09,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_944]. (and (= (store v_main_a_944 main_y 1000) main_a) (= 0 (select v_main_a_944 main_x))) [2019-05-15 10:32:09,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:32:09,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:09,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:09,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:09,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:09,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,402 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:09,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:09,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:09,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:09,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_945]. (let ((.cse2 (select v_main_a_945 main_x))) (let ((.cse0 (= 1000 (select v_main_a_945 main_y))) (.cse1 (= (store v_main_a_945 main_x (+ .cse2 1)) main_a))) (or (and .cse0 .cse1 (= .cse2 0)) (and .cse0 (= main_y main_x) .cse1)))) [2019-05-15 10:32:09,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:32:09,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:09,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:09,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:09,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:09,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:09,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,496 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:09,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:09,497 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:09,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:09,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_946]. (let ((.cse2 (select v_main_a_946 main_y))) (let ((.cse1 (= (store v_main_a_946 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_946 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 1000) .cse1 (= .cse0 1))))) [2019-05-15 10:32:09,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:09,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:09,566 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:09,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:09,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:09,573 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,608 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:09,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:09,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:09,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:09,620 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_947]. (let ((.cse1 (select v_main_a_947 main_x))) (let ((.cse0 (= (store v_main_a_947 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 1 .cse1) (= (select v_main_a_947 main_y) 999)) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:32:09,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:32:09,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:09,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:09,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:09,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:09,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:09,675 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,710 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:09,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:09,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:09,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:09,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_948]. (let ((.cse2 (select v_main_a_948 main_y))) (let ((.cse1 (select v_main_a_948 main_x)) (.cse0 (= (store v_main_a_948 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 2) .cse0 (= 999 .cse2))))) [2019-05-15 10:32:09,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:09,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:09,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:09,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:09,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:09,788 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,812 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:09,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:09,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:09,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:09,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_949]. (let ((.cse1 (select v_main_a_949 main_x))) (let ((.cse0 (= (store v_main_a_949 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_949 main_y) 998) .cse0 (= .cse1 2)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:32:09,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:32:09,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:09,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:09,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:09,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,882 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:09,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:09,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:09,908 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:09,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:09,909 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:09,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:09,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_950]. (let ((.cse2 (select v_main_a_950 main_y))) (let ((.cse0 (= (store v_main_a_950 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_950 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= .cse2 998) .cse0 (= 3 .cse1))))) [2019-05-15 10:32:09,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:09,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:10,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,043 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_951]. (let ((.cse1 (select v_main_a_951 main_x))) (let ((.cse0 (= (store v_main_a_951 main_x (+ .cse1 1)) main_a))) (or (and (= 997 (select v_main_a_951 main_y)) .cse0 (= 3 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:32:10,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:32:10,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:10,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,141 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_952]. (let ((.cse2 (select v_main_a_952 main_y))) (let ((.cse1 (= main_a (store v_main_a_952 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_952 main_x))) (or (and (= 4 .cse0) .cse1 (= 997 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:32:10,170 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:10,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:10,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,267 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,280 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_953]. (let ((.cse0 (select v_main_a_953 main_x))) (let ((.cse1 (= (store v_main_a_953 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 4) (= (select v_main_a_953 main_y) 996))))) [2019-05-15 10:32:10,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:32:10,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:10,346 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,370 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_954]. (let ((.cse0 (select v_main_a_954 main_y))) (let ((.cse1 (= (store v_main_a_954 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_954 main_x))) (or (and (= 996 .cse0) .cse1 (= 5 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:32:10,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:10,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,446 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:10,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,477 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_955]. (let ((.cse1 (select v_main_a_955 main_x))) (let ((.cse0 (= (store v_main_a_955 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_955 main_y) 995) (= .cse1 5)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:32:10,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:32:10,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,552 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:10,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,596 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_956]. (let ((.cse2 (select v_main_a_956 main_y))) (let ((.cse0 (select v_main_a_956 main_x)) (.cse1 (= (store v_main_a_956 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 6 .cse0) .cse1 (= .cse2 995)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:32:10,615 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:10,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:10,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,704 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_957]. (let ((.cse1 (select v_main_a_957 main_x))) (let ((.cse0 (= (store v_main_a_957 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= .cse1 6) (= (select v_main_a_957 main_y) 994))))) [2019-05-15 10:32:10,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:32:10,760 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:10,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:10,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,806 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_958]. (let ((.cse2 (select v_main_a_958 main_y))) (let ((.cse0 (select v_main_a_958 main_x)) (.cse1 (= (store v_main_a_958 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 7 .cse0) .cse1 (= .cse2 994))))) [2019-05-15 10:32:10,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:32:10,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:10,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,912 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:10,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:10,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:10,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:10,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_959]. (let ((.cse0 (select v_main_a_959 main_x))) (let ((.cse1 (= (store v_main_a_959 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 7) (= 993 (select v_main_a_959 main_y)))))) [2019-05-15 10:32:10,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:32:10,973 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:10,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:10,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:10,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:10,995 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:10,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:10,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,022 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:11,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:11,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_960]. (let ((.cse2 (select v_main_a_960 main_y))) (let ((.cse0 (select v_main_a_960 main_x)) (.cse1 (= (store v_main_a_960 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 8 .cse0) .cse1 (= .cse2 993))))) [2019-05-15 10:32:11,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:32:11,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:11,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:11,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:11,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:11,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,137 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:11,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:11,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_961]. (let ((.cse1 (select v_main_a_961 main_x))) (let ((.cse0 (= (store v_main_a_961 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_961 main_y) 992) .cse0 (= .cse1 8))))) [2019-05-15 10:32:11,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:32:11,200 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:11,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:11,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:11,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:11,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:11,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,249 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:11,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:11,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_962]. (let ((.cse2 (select v_main_a_962 main_y))) (let ((.cse0 (select v_main_a_962 main_x)) (.cse1 (= main_a (store v_main_a_962 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 992 .cse2) (= 9 .cse0) .cse1)))) [2019-05-15 10:32:11,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:32:11,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:11,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:11,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:11,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:11,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,371 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:11,380 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:11,380 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_963]. (let ((.cse1 (select v_main_a_963 main_x))) (let ((.cse0 (= (store v_main_a_963 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 9 .cse1) (= 991 (select v_main_a_963 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:32:11,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:32:11,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:11,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:11,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:11,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:11,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:11,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,481 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,481 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:11,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:11,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_964]. (let ((.cse2 (select v_main_a_964 main_y))) (let ((.cse0 (select v_main_a_964 main_x)) (.cse1 (= (store v_main_a_964 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 991) (= .cse0 10) .cse1)))) [2019-05-15 10:32:11,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:11,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:11,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:11,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:11,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:11,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,615 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:11,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:11,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_965]. (let ((.cse0 (select v_main_a_965 main_x))) (let ((.cse1 (= (store v_main_a_965 main_x (+ .cse0 1)) main_a))) (or (and (= 990 (select v_main_a_965 main_y)) (= 10 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:32:11,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:32:11,683 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:11,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:11,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:11,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:11,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:11,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,733 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:11,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:11,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_966]. (let ((.cse2 (select v_main_a_966 main_y))) (let ((.cse0 (select v_main_a_966 main_x)) (.cse1 (= (store v_main_a_966 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 11 .cse0) .cse1 (= 990 .cse2))))) [2019-05-15 10:32:11,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:32:11,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:11,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:11,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:11,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:11,824 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,848 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,849 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:11,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:11,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_967]. (let ((.cse1 (select v_main_a_967 main_x))) (let ((.cse0 (= (store v_main_a_967 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 11 .cse1) .cse0 (= 989 (select v_main_a_967 main_y)))))) [2019-05-15 10:32:11,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:32:11,921 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:11,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:11,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:11,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:11,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:11,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:11,970 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:11,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:11,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:12,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_968]. (let ((.cse2 (select v_main_a_968 main_y))) (let ((.cse0 (select v_main_a_968 main_x)) (.cse1 (= (store v_main_a_968 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 989 .cse2) (= .cse0 12) .cse1)))) [2019-05-15 10:32:12,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:12,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:12,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:12,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:12,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,177 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:12,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:12,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:12,191 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,191 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_969]. (let ((.cse0 (select v_main_a_969 main_x))) (let ((.cse1 (= (store v_main_a_969 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_969 main_y) 988) (= 12 .cse0) .cse1)))) [2019-05-15 10:32:12,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:32:12,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:12,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:12,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:12,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:12,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,358 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:12,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:12,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:12,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_970]. (let ((.cse2 (select v_main_a_970 main_y))) (let ((.cse1 (select v_main_a_970 main_x)) (.cse0 (= (store v_main_a_970 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 13 .cse1) .cse0 (= .cse2 988))))) [2019-05-15 10:32:12,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:12,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:12,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:12,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,528 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:12,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,566 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:12,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:12,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:12,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_971]. (let ((.cse1 (select v_main_a_971 main_x))) (let ((.cse0 (= (store v_main_a_971 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 13) (= 987 (select v_main_a_971 main_y)) .cse0)))) [2019-05-15 10:32:12,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:32:12,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:12,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:12,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:12,668 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,704 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:12,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:12,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:12,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_972]. (let ((.cse0 (select v_main_a_972 main_y))) (let ((.cse2 (= main_a (store v_main_a_972 main_y (+ .cse0 (- 1))))) (.cse1 (select v_main_a_972 main_x))) (or (and (= .cse0 987) (= 14 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:32:12,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:32:12,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:12,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:12,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:12,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,838 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:12,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:12,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:12,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_973]. (let ((.cse0 (select v_main_a_973 main_x))) (let ((.cse1 (= (store v_main_a_973 main_x (+ .cse0 1)) main_a))) (or (and (= 14 .cse0) .cse1 (= 986 (select v_main_a_973 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:32:12,851 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:32:12,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:12,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:12,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:12,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:12,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,966 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:12,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:12,967 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:12,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_974]. (let ((.cse2 (select v_main_a_974 main_y))) (let ((.cse0 (= main_a (store v_main_a_974 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_974 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 986) (= .cse1 15))))) [2019-05-15 10:32:12,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:13,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:13,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:13,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:13,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,106 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:13,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:13,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:13,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_975]. (let ((.cse0 (select v_main_a_975 main_x))) (let ((.cse1 (= (store v_main_a_975 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 15) (= 985 (select v_main_a_975 main_y)) .cse1)))) [2019-05-15 10:32:13,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:32:13,186 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:13,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:13,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:13,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:13,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,247 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:13,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:13,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:13,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_976]. (let ((.cse2 (select v_main_a_976 main_y))) (let ((.cse1 (= (store v_main_a_976 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_976 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 985) (= .cse0 16))))) [2019-05-15 10:32:13,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:13,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:13,380 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:13,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:13,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,414 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:13,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:13,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:13,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,427 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_977]. (let ((.cse1 (select v_main_a_977 main_x))) (let ((.cse0 (= (store v_main_a_977 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 984 (select v_main_a_977 main_y)) (= .cse1 16)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:32:13,427 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:32:13,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:13,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:13,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:13,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:13,525 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,550 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:13,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:13,550 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:13,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_978]. (let ((.cse2 (select v_main_a_978 main_y))) (let ((.cse0 (= (store v_main_a_978 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_978 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 17 .cse1) (= .cse2 984))))) [2019-05-15 10:32:13,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:32:13,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:13,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:13,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,655 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:13,658 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,683 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:13,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:13,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:13,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_979]. (let ((.cse1 (select v_main_a_979 main_x))) (let ((.cse0 (= (store v_main_a_979 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 17) (= (select v_main_a_979 main_y) 983))))) [2019-05-15 10:32:13,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:32:13,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:13,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:13,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:13,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,834 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:13,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:13,834 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:13,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_980]. (let ((.cse2 (select v_main_a_980 main_y))) (let ((.cse0 (select v_main_a_980 main_x)) (.cse1 (= (store v_main_a_980 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 18) .cse1 (= 983 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:32:13,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:13,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:13,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:13,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,017 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:14,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,042 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:14,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:14,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:14,054 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_981]. (let ((.cse0 (select v_main_a_981 main_x))) (let ((.cse1 (= (store v_main_a_981 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 18 .cse0) (= (select v_main_a_981 main_y) 982))))) [2019-05-15 10:32:14,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:32:14,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:14,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:14,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:14,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,175 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:14,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:14,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:14,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_982]. (let ((.cse2 (select v_main_a_982 main_y))) (let ((.cse1 (= (store v_main_a_982 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_982 main_x))) (or (and (= .cse0 19) .cse1 (= 982 .cse2)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:32:14,186 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:32:14,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:14,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:14,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:14,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,302 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:14,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:14,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:14,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,316 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_983]. (let ((.cse0 (select v_main_a_983 main_x))) (let ((.cse1 (= (store v_main_a_983 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= (select v_main_a_983 main_y) 981) (= 19 .cse0))))) [2019-05-15 10:32:14,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:32:14,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:14,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:14,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:14,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:14,416 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,451 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:14,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:14,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:14,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_984]. (let ((.cse2 (select v_main_a_984 main_y))) (let ((.cse1 (= (store v_main_a_984 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_984 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 20 .cse0) (= .cse2 981))))) [2019-05-15 10:32:14,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:14,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:14,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:14,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:14,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,659 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:14,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:14,659 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:14,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_985]. (let ((.cse1 (select v_main_a_985 main_x))) (let ((.cse0 (= (store v_main_a_985 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_985 main_y) 980) .cse0 (= 20 .cse1))))) [2019-05-15 10:32:14,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:32:14,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:14,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:14,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:14,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:14,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,790 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:14,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:14,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:14,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_986]. (let ((.cse2 (select v_main_a_986 main_y))) (let ((.cse0 (= (store v_main_a_986 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_986 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 980) (= 21 .cse1))))) [2019-05-15 10:32:14,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:14,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:15,162 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:32:15,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:15,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:15,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,906 WARN L188 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:32:15,907 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:15,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:15,908 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:15,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_987]. (let ((.cse0 (select v_main_a_987 main_x))) (let ((.cse1 (= (store v_main_a_987 main_x (+ .cse0 1)) main_a))) (or (and (= 21 .cse0) .cse1 (= 979 (select v_main_a_987 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:32:15,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:32:17,207 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-15 10:32:17,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:17,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:17,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:17,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,873 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:32:17,874 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:17,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,506 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:32:18,506 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:18,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:18,506 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:18,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_988]. (let ((.cse2 (select v_main_a_988 main_y))) (let ((.cse1 (= main_a (store v_main_a_988 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_988 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 979 .cse2) (= 22 .cse0))))) [2019-05-15 10:32:18,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:32:18,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:18,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:18,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:18,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,647 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:18,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:18,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:18,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_989]. (let ((.cse0 (select v_main_a_989 main_x))) (let ((.cse1 (= (store v_main_a_989 main_x (+ .cse0 1)) main_a))) (or (and (= 22 .cse0) .cse1 (= 978 (select v_main_a_989 main_y))) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:32:18,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:32:18,741 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:18,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:18,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:18,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:18,766 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,802 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:18,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:18,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:18,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_990]. (let ((.cse2 (select v_main_a_990 main_y))) (let ((.cse0 (select v_main_a_990 main_x)) (.cse1 (= (store v_main_a_990 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 23 .cse0) (= 978 .cse2) .cse1)))) [2019-05-15 10:32:18,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:18,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:18,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:18,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:18,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,987 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:18,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:18,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:19,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:19,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_991]. (let ((.cse0 (select v_main_a_991 main_x))) (let ((.cse1 (= (store v_main_a_991 main_x (+ .cse0 1)) main_a))) (or (and (= 23 .cse0) (= 977 (select v_main_a_991 main_y)) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:32:19,000 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:32:19,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:19,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:19,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:19,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:19,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,133 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:19,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:19,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:19,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:19,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_992]. (let ((.cse2 (select v_main_a_992 main_y))) (let ((.cse0 (select v_main_a_992 main_x)) (.cse1 (= (store v_main_a_992 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 24 .cse0) .cse1 (= 977 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:32:19,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:19,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:19,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:19,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:19,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:19,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,339 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:19,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:19,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:19,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:19,348 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_993]. (let ((.cse1 (select v_main_a_993 main_x))) (let ((.cse0 (= (store v_main_a_993 main_x (+ .cse1 1)) main_a))) (or (and (= 976 (select v_main_a_993 main_y)) .cse0 (= .cse1 24)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:32:19,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:32:19,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:19,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:19,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:19,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:19,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,482 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:19,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:19,483 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:19,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:19,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_994]. (let ((.cse0 (select v_main_a_994 main_y))) (let ((.cse2 (select v_main_a_994 main_x)) (.cse1 (= (store v_main_a_994 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 976) .cse1 (= .cse2 25)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:32:19,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:19,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:19,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:19,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,654 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:19,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:19,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,681 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:19,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:19,682 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:19,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:19,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_995]. (let ((.cse0 (select v_main_a_995 main_x))) (let ((.cse1 (= (store v_main_a_995 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 25 .cse0) (= 975 (select v_main_a_995 main_y)))))) [2019-05-15 10:32:19,693 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:32:19,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:19,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:19,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:19,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:19,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:19,832 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:19,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:19,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:19,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:19,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_996]. (let ((.cse1 (select v_main_a_996 main_y))) (let ((.cse2 (select v_main_a_996 main_x)) (.cse0 (= (store v_main_a_996 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= 975 .cse1) (= 26 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse0)))) [2019-05-15 10:32:19,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:19,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:20,011 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:20,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:20,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:20,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,044 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:20,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:20,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:20,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:20,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_997]. (let ((.cse1 (select v_main_a_997 main_x))) (let ((.cse0 (= (store v_main_a_997 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 26) (= (select v_main_a_997 main_y) 974)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:32:20,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:32:20,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:20,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:20,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:20,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:20,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,197 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:20,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:20,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:20,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:20,276 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_998]. (let ((.cse0 (select v_main_a_998 main_y))) (let ((.cse1 (select v_main_a_998 main_x)) (.cse2 (= (store v_main_a_998 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 974 .cse0) (= 27 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:32:20,276 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:20,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:20,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:20,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:20,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:20,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,418 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:20,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:20,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:20,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:20,430 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_999]. (let ((.cse1 (select v_main_a_999 main_x))) (let ((.cse0 (= main_a (store v_main_a_999 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 27) (= 973 (select v_main_a_999 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:32:20,430 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:32:20,521 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:20,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:20,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:20,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:20,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:20,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,570 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:20,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:20,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:20,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:20,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1000]. (let ((.cse2 (select v_main_a_1000 main_y))) (let ((.cse0 (select v_main_a_1000 main_x)) (.cse1 (= main_a (store v_main_a_1000 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 973 .cse2) (= 28 .cse0) .cse1)))) [2019-05-15 10:32:20,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:20,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:20,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:20,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:20,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:20,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,764 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:20,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:20,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:20,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:20,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1001]. (let ((.cse1 (select v_main_a_1001 main_x))) (let ((.cse0 (= (store v_main_a_1001 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 28) (= (select v_main_a_1001 main_y) 972))))) [2019-05-15 10:32:20,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:32:20,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:20,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:20,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:20,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:20,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:20,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:20,920 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:20,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:20,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:20,984 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:20,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1002]. (let ((.cse2 (select v_main_a_1002 main_y))) (let ((.cse0 (select v_main_a_1002 main_x)) (.cse1 (= (store v_main_a_1002 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 972) (= .cse0 29) .cse1)))) [2019-05-15 10:32:20,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:21,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:21,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:21,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:21,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:21,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:21,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:21,127 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:21,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:21,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:21,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:21,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1003]. (let ((.cse0 (select v_main_a_1003 main_x))) (let ((.cse1 (= main_a (store v_main_a_1003 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 29) (= (select v_main_a_1003 main_y) 971) .cse1)))) [2019-05-15 10:32:21,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:32:21,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:21,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:21,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:21,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:21,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:21,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:21,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:21,296 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:21,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:21,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:21,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:21,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1004]. (let ((.cse2 (select v_main_a_1004 main_y))) (let ((.cse0 (= (store v_main_a_1004 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1004 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 971) (= .cse1 30))))) [2019-05-15 10:32:21,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:21,451 INFO L273 TraceCheckUtils]: 0: Hoare triple {8265#true} a := a[x := 0]; {8270#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:32:21,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {8270#(= (select main_a main_x) 0)} a := a[y := 1000]; {8274#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:32:21,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {8274#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {8278#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:32:21,454 INFO L273 TraceCheckUtils]: 3: Hoare triple {8278#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {8282#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,455 INFO L273 TraceCheckUtils]: 4: Hoare triple {8282#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8286#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:32:21,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {8286#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {8290#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {8290#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8294#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:32:21,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {8294#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {8298#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {8298#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8302#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:32:21,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {8302#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {8306#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {8306#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8310#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:32:21,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {8310#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {8314#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {8314#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8318#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:32:21,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {8318#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {8322#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:32:21,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {8322#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {8326#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:32:21,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {8326#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {8330#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:32:21,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {8330#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {8334#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:32:21,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {8334#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {8338#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:32:21,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {8338#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {8342#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:32:21,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {8342#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {8346#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {8346#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8350#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:32:21,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {8350#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {8354#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {8354#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8358#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:32:21,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {8358#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {8362#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:32:21,478 INFO L273 TraceCheckUtils]: 24: Hoare triple {8362#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {8366#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:32:21,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {8366#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {8370#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {8370#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8374#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:32:21,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {8374#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {8378#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,483 INFO L273 TraceCheckUtils]: 28: Hoare triple {8378#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8382#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:32:21,484 INFO L273 TraceCheckUtils]: 29: Hoare triple {8382#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {8386#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:32:21,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {8386#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {8390#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:32:21,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {8390#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {8394#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {8394#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8398#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:32:21,488 INFO L273 TraceCheckUtils]: 33: Hoare triple {8398#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {8402#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,489 INFO L273 TraceCheckUtils]: 34: Hoare triple {8402#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8406#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:32:21,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {8406#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {8410#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:32:21,492 INFO L273 TraceCheckUtils]: 36: Hoare triple {8410#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {8414#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:32:21,493 INFO L273 TraceCheckUtils]: 37: Hoare triple {8414#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {8418#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {8418#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8422#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:32:21,495 INFO L273 TraceCheckUtils]: 39: Hoare triple {8422#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {8426#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:32:21,496 INFO L273 TraceCheckUtils]: 40: Hoare triple {8426#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {8430#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:32:21,497 INFO L273 TraceCheckUtils]: 41: Hoare triple {8430#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {8434#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,498 INFO L273 TraceCheckUtils]: 42: Hoare triple {8434#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8438#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:32:21,500 INFO L273 TraceCheckUtils]: 43: Hoare triple {8438#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {8442#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {8442#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8446#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:32:21,502 INFO L273 TraceCheckUtils]: 45: Hoare triple {8446#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {8450#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:32:21,503 INFO L273 TraceCheckUtils]: 46: Hoare triple {8450#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {8454#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:32:21,504 INFO L273 TraceCheckUtils]: 47: Hoare triple {8454#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {8458#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,505 INFO L273 TraceCheckUtils]: 48: Hoare triple {8458#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8462#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:32:21,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {8462#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {8466#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,508 INFO L273 TraceCheckUtils]: 50: Hoare triple {8466#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8470#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:32:21,509 INFO L273 TraceCheckUtils]: 51: Hoare triple {8470#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {8474#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {8474#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8478#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:32:21,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {8478#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {8482#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,512 INFO L273 TraceCheckUtils]: 54: Hoare triple {8482#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8486#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:32:21,513 INFO L273 TraceCheckUtils]: 55: Hoare triple {8486#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {8490#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,514 INFO L273 TraceCheckUtils]: 56: Hoare triple {8490#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8494#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:32:21,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {8494#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {8498#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,517 INFO L273 TraceCheckUtils]: 58: Hoare triple {8498#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8502#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:32:21,518 INFO L273 TraceCheckUtils]: 59: Hoare triple {8502#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {8506#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,519 INFO L273 TraceCheckUtils]: 60: Hoare triple {8506#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8510#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:32:21,520 INFO L273 TraceCheckUtils]: 61: Hoare triple {8510#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {8514#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:21,521 INFO L273 TraceCheckUtils]: 62: Hoare triple {8514#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {8266#false} is VALID [2019-05-15 10:32:21,521 INFO L273 TraceCheckUtils]: 63: Hoare triple {8266#false} assume !(a[y] <= 0); {8266#false} is VALID [2019-05-15 10:32:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:21,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:21,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-15 10:32:21,538 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-05-15 10:32:21,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:21,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2019-05-15 10:32:21,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:21,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-05-15 10:32:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-15 10:32:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-05-15 10:32:21,625 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-05-15 10:32:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:32,008 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:32:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-15 10:32:32,009 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-05-15 10:32:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-05-15 10:32:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-05-15 10:32:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-05-15 10:32:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-05-15 10:32:32,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2019-05-15 10:32:32,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:32,100 INFO L225 Difference]: With dead ends: 67 [2019-05-15 10:32:32,100 INFO L226 Difference]: Without dead ends: 67 [2019-05-15 10:32:32,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-05-15 10:32:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-05-15 10:32:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-05-15 10:32:32,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:32,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:32,103 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:32,103 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:32,104 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:32:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:32:32,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:32,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:32,105 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:32,105 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:32,106 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:32:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:32:32,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:32,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:32,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:32,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-05-15 10:32:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-05-15 10:32:32,108 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-05-15 10:32:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:32,108 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-05-15 10:32:32,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-05-15 10:32:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:32:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-05-15 10:32:32,109 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:32,109 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-05-15 10:32:32,109 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash -999764862, now seen corresponding path program 31 times [2019-05-15 10:32:32,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:32,180 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-15 10:32:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:32,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:32,306 INFO L375 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 6 treesize of output 5 [2019-05-15 10:32:32,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:32,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1005]. (= (store v_main_a_1005 main_x 0) main_a) [2019-05-15 10:32:32,353 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:32:32,380 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:32:32,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,396 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:32:32,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:32:32,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,399 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1006]. (and (= main_a (store v_main_a_1006 main_y 1000)) (= (select v_main_a_1006 main_x) 0)) [2019-05-15 10:32:32,399 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:32:32,424 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:32,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:32,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:32,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:32,449 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,473 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:32,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:32,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:32,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1007]. (let ((.cse2 (select v_main_a_1007 main_x))) (let ((.cse0 (= (select v_main_a_1007 main_y) 1000)) (.cse1 (= main_a (store v_main_a_1007 main_x (+ .cse2 1))))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:32:32,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:32:32,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:32,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:32,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:32,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,580 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:32,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:32,580 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:32,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1008]. (let ((.cse0 (select v_main_a_1008 main_y))) (let ((.cse1 (select v_main_a_1008 main_x)) (.cse2 (= (store v_main_a_1008 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 1000) (= .cse1 1) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:32:32,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:32,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:32,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:32,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:32,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,778 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:32,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:32,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:32,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,790 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1009]. (let ((.cse0 (select v_main_a_1009 main_x))) (let ((.cse1 (= (store v_main_a_1009 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 1) .cse1 (= (select v_main_a_1009 main_y) 999)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:32:32,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:32:32,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:32,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:32,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:32,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:32,882 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,916 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:32,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:32,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:32,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1010]. (let ((.cse2 (select v_main_a_1010 main_y))) (let ((.cse1 (= (store v_main_a_1010 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1010 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 999 .cse2) (= 2 .cse0))))) [2019-05-15 10:32:32,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:33,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:33,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:33,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:33,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,059 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:33,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:33,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:33,070 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,070 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1011]. (let ((.cse0 (select v_main_a_1011 main_x))) (let ((.cse1 (= (store v_main_a_1011 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= 998 (select v_main_a_1011 main_y)) (= .cse0 2))))) [2019-05-15 10:32:33,070 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:32:33,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:33,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:33,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:33,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,165 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:33,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:33,166 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:33,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1012]. (let ((.cse2 (select v_main_a_1012 main_y))) (let ((.cse0 (= (store v_main_a_1012 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1012 main_x))) (or (and .cse0 (= .cse1 3) (= .cse2 998)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:32:33,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:33,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:33,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:33,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:33,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,290 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:33,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:33,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:33,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1013]. (let ((.cse0 (select v_main_a_1013 main_x))) (let ((.cse1 (= (store v_main_a_1013 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 3) (= (select v_main_a_1013 main_y) 997) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:33,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:32:33,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:33,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:33,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:33,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:33,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,387 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:33,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:33,388 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:33,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1014]. (let ((.cse2 (select v_main_a_1014 main_y))) (let ((.cse0 (= (store v_main_a_1014 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1014 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 997 .cse2) (= 4 .cse1))))) [2019-05-15 10:32:33,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:33,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:33,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:33,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:33,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,526 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:33,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:33,526 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:33,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1015]. (let ((.cse1 (select v_main_a_1015 main_x))) (let ((.cse0 (= (store v_main_a_1015 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1015 main_y) 996) .cse0 (= .cse1 4)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:32:33,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:32:33,581 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:33,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:33,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:33,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:33,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,629 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:33,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:33,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:33,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1016]. (let ((.cse2 (select v_main_a_1016 main_y))) (let ((.cse0 (= (store v_main_a_1016 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1016 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 5 .cse1) (= 996 .cse2))))) [2019-05-15 10:32:33,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:33,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:33,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:33,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:33,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,753 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:33,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:33,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:33,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1017]. (let ((.cse0 (select v_main_a_1017 main_x))) (let ((.cse1 (= (store v_main_a_1017 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1017 main_y) 995) (= .cse0 5) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:33,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:32:33,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:33,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:33,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:33,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,831 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:33,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,869 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:33,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:33,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:33,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1018]. (let ((.cse2 (select v_main_a_1018 main_y))) (let ((.cse0 (select v_main_a_1018 main_x)) (.cse1 (= main_a (store v_main_a_1018 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 6) (= .cse2 995) .cse1)))) [2019-05-15 10:32:33,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:34,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:34,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:34,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:34,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,058 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:34,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:34,058 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:34,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1019]. (let ((.cse1 (select v_main_a_1019 main_x))) (let ((.cse0 (= (store v_main_a_1019 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1019 main_y) 994) (= .cse1 6))))) [2019-05-15 10:32:34,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:32:34,112 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:34,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:34,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:34,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:34,135 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,160 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:34,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:34,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:34,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1020]. (let ((.cse2 (select v_main_a_1020 main_y))) (let ((.cse0 (= (store v_main_a_1020 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1020 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= .cse2 994) (= 7 .cse1))))) [2019-05-15 10:32:34,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:32:34,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:34,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:34,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:34,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,263 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:34,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:34,263 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:34,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1021]. (let ((.cse1 (select v_main_a_1021 main_x))) (let ((.cse0 (= main_a (store v_main_a_1021 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1021 main_y) 993) (= .cse1 7))))) [2019-05-15 10:32:34,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:32:34,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:34,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:34,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:34,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:34,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,368 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:34,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:34,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:34,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1022]. (let ((.cse2 (select v_main_a_1022 main_y))) (let ((.cse0 (= (store v_main_a_1022 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1022 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 8) (= .cse2 993))))) [2019-05-15 10:32:34,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:32:34,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:34,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:34,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:34,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,475 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:34,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:34,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:34,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1023]. (let ((.cse1 (select v_main_a_1023 main_x))) (let ((.cse0 (= main_a (store v_main_a_1023 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 8) (= (select v_main_a_1023 main_y) 992)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:32:34,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:32:34,541 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:34,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:34,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:34,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:34,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,588 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:34,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:34,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:34,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1024]. (let ((.cse2 (select v_main_a_1024 main_y))) (let ((.cse0 (= (store v_main_a_1024 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1024 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 9) (= .cse2 992))))) [2019-05-15 10:32:34,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:32:34,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:34,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:34,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:34,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,707 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:34,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:34,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:34,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1025]. (let ((.cse0 (select v_main_a_1025 main_x))) (let ((.cse1 (= (store v_main_a_1025 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 991 (select v_main_a_1025 main_y)) (= .cse0 9) .cse1)))) [2019-05-15 10:32:34,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:32:34,772 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:34,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:34,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:34,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,043 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:32:35,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:35,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,286 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:32:35,286 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:35,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:35,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:35,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1026]. (let ((.cse2 (select v_main_a_1026 main_y))) (let ((.cse0 (select v_main_a_1026 main_x)) (.cse1 (= (store v_main_a_1026 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 991 .cse2) (= .cse0 10) .cse1)))) [2019-05-15 10:32:35,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:35,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:35,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:35,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:35,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,431 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:35,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:35,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:35,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1027]. (let ((.cse1 (select v_main_a_1027 main_x))) (let ((.cse0 (= (store v_main_a_1027 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 10) (= (select v_main_a_1027 main_y) 990)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:32:35,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:32:35,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:35,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:35,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:35,533 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,558 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:35,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:35,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:35,570 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1028]. (let ((.cse0 (select v_main_a_1028 main_y))) (let ((.cse1 (= main_a (store v_main_a_1028 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_1028 main_x))) (or (and (= .cse0 990) .cse1 (= .cse2 11)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:32:35,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:32:35,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:35,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:35,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:35,650 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,675 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:35,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:35,675 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:35,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1029]. (let ((.cse1 (select v_main_a_1029 main_x))) (let ((.cse0 (= (store v_main_a_1029 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 11) .cse0 (= (select v_main_a_1029 main_y) 989))))) [2019-05-15 10:32:35,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:32:35,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:35,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:35,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:35,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:35,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,792 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:35,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:35,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:35,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1030]. (let ((.cse2 (select v_main_a_1030 main_y))) (let ((.cse0 (select v_main_a_1030 main_x)) (.cse1 (= (store v_main_a_1030 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 12) (= .cse2 989) .cse1)))) [2019-05-15 10:32:35,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:35,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:35,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:35,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,946 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:35,949 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,984 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:35,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:35,985 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:35,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1031]. (let ((.cse1 (select v_main_a_1031 main_x))) (let ((.cse0 (= (store v_main_a_1031 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 12 .cse1) (= (select v_main_a_1031 main_y) 988))))) [2019-05-15 10:32:35,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:32:36,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:36,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:36,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:36,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:36,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,117 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:36,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:36,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:36,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1032]. (let ((.cse2 (select v_main_a_1032 main_y))) (let ((.cse0 (= main_a (store v_main_a_1032 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1032 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 988) (= .cse1 13))))) [2019-05-15 10:32:36,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:36,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:36,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:36,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:36,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,259 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:36,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:36,260 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:36,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1033]. (let ((.cse0 (select v_main_a_1033 main_x))) (let ((.cse1 (= main_a (store v_main_a_1033 main_x (+ .cse0 1))))) (or (and (= (select v_main_a_1033 main_y) 987) (= .cse0 13) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:36,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:32:36,333 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:36,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:36,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:36,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,354 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:36,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,390 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:36,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:36,391 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:36,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1034]. (let ((.cse2 (select v_main_a_1034 main_y))) (let ((.cse0 (= (store v_main_a_1034 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1034 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 987 .cse2) .cse0 (= .cse1 14))))) [2019-05-15 10:32:36,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:32:36,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:36,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:36,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:36,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,519 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:36,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:36,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:36,530 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1035]. (let ((.cse1 (select v_main_a_1035 main_x))) (let ((.cse0 (= (store v_main_a_1035 main_x (+ .cse1 1)) main_a))) (or (and (= 986 (select v_main_a_1035 main_y)) .cse0 (= 14 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:32:36,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:32:36,597 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:36,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:36,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:36,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:36,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,647 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:36,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:36,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:36,690 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,690 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1036]. (let ((.cse2 (select v_main_a_1036 main_y))) (let ((.cse0 (= main_a (store v_main_a_1036 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1036 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 15) (= .cse2 986))))) [2019-05-15 10:32:36,690 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:36,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:36,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:36,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:36,784 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,809 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:36,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:36,809 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:36,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,821 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1037]. (let ((.cse0 (select v_main_a_1037 main_x))) (let ((.cse1 (= (store v_main_a_1037 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 15) (= (select v_main_a_1037 main_y) 985) .cse1)))) [2019-05-15 10:32:36,821 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:32:36,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:36,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:36,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:36,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,914 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:36,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,952 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:36,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:36,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:37,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:37,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1038]. (let ((.cse2 (select v_main_a_1038 main_y))) (let ((.cse1 (select v_main_a_1038 main_x)) (.cse0 (= (store v_main_a_1038 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 16) .cse0 (= .cse2 985))))) [2019-05-15 10:32:37,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:37,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:37,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:37,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:37,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:37,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,164 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:37,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:37,165 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:37,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:37,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1039]. (let ((.cse1 (select v_main_a_1039 main_x))) (let ((.cse0 (= (store v_main_a_1039 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= 984 (select v_main_a_1039 main_y)) (= .cse1 16))))) [2019-05-15 10:32:37,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:32:37,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:37,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:37,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:37,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:37,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,301 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:37,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:37,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:37,309 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:37,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1040]. (let ((.cse1 (select v_main_a_1040 main_y))) (let ((.cse2 (select v_main_a_1040 main_x)) (.cse0 (= (store v_main_a_1040 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= .cse1 984) (= .cse2 17)) (and (= main_y main_x) (= .cse2 1001) .cse0)))) [2019-05-15 10:32:37,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:32:37,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:37,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:37,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:37,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:37,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,445 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:37,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:37,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:37,457 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:37,457 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1041]. (let ((.cse1 (select v_main_a_1041 main_x))) (let ((.cse0 (= (store v_main_a_1041 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_1041 main_y) 983) .cse0 (= 17 .cse1))))) [2019-05-15 10:32:37,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:32:37,531 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:37,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:37,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:37,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:37,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:37,557 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,591 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:37,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:37,591 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:37,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:37,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1042]. (let ((.cse2 (select v_main_a_1042 main_y))) (let ((.cse0 (= (store v_main_a_1042 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1042 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 983) .cse0 (= .cse1 18))))) [2019-05-15 10:32:37,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:37,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:37,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:37,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:37,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:37,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,810 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:37,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:37,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:37,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:37,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1043]. (let ((.cse0 (select v_main_a_1043 main_x))) (let ((.cse1 (= main_a (store v_main_a_1043 main_x (+ .cse0 1))))) (or (and (= (select v_main_a_1043 main_y) 982) (= 18 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:32:37,822 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:32:37,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:37,941 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:37,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:37,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:37,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:37,975 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:37,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:37,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:37,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:37,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1044]. (let ((.cse0 (select v_main_a_1044 main_y))) (let ((.cse1 (select v_main_a_1044 main_x)) (.cse2 (= (store v_main_a_1044 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 982) (= .cse1 19) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:32:37,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:32:38,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:38,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:38,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:38,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:38,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,112 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:38,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:38,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:38,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:38,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1045]. (let ((.cse0 (select v_main_a_1045 main_x))) (let ((.cse1 (= (store v_main_a_1045 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 19) .cse1 (= (select v_main_a_1045 main_y) 981))))) [2019-05-15 10:32:38,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:32:38,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:38,221 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:38,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:38,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:38,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,266 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:38,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:38,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:38,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:38,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1046]. (let ((.cse0 (select v_main_a_1046 main_y))) (let ((.cse2 (= (store v_main_a_1046 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1046 main_x))) (or (and (= .cse0 981) (= .cse1 20) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:32:38,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:38,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:38,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:38,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:38,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:38,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,441 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:38,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:38,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:38,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:38,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1047]. (let ((.cse1 (select v_main_a_1047 main_x))) (let ((.cse0 (= (store v_main_a_1047 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1047 main_y) 980) (= .cse1 20) .cse0)))) [2019-05-15 10:32:38,456 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:32:38,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:38,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:38,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:38,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:38,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,575 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:38,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:38,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:38,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:38,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1048]. (let ((.cse1 (select v_main_a_1048 main_y))) (let ((.cse2 (= (store v_main_a_1048 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1048 main_x))) (or (and (= .cse0 21) (= .cse1 980) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:32:38,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:38,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:38,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:38,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:38,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:38,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,810 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:38,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:38,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:38,823 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:38,823 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1049]. (let ((.cse0 (select v_main_a_1049 main_x))) (let ((.cse1 (= (store v_main_a_1049 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 21) (= (select v_main_a_1049 main_y) 979) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:38,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:32:38,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:38,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:38,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:38,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:38,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:38,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:38,948 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:38,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:38,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:38,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:38,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1050]. (let ((.cse2 (select v_main_a_1050 main_y))) (let ((.cse0 (= main_a (store v_main_a_1050 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1050 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 22) (= .cse2 979))))) [2019-05-15 10:32:38,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:32:39,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:39,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:39,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:39,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:39,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,083 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:39,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:39,084 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:39,094 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:39,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1051]. (let ((.cse1 (select v_main_a_1051 main_x))) (let ((.cse0 (= (store v_main_a_1051 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1051 main_y) 978) (= .cse1 22))))) [2019-05-15 10:32:39,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:32:39,175 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:39,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:39,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:39,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:39,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:39,198 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,233 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:39,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:39,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:39,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:39,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1052]. (let ((.cse2 (select v_main_a_1052 main_y))) (let ((.cse0 (select v_main_a_1052 main_x)) (.cse1 (= (store v_main_a_1052 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 23) (= .cse2 978) .cse1)))) [2019-05-15 10:32:39,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:39,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:39,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:39,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:39,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:39,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,451 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:39,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:39,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:39,462 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:39,463 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1053]. (let ((.cse0 (select v_main_a_1053 main_x))) (let ((.cse1 (= (store v_main_a_1053 main_x (+ .cse0 1)) main_a))) (or (and (= 23 .cse0) .cse1 (= 977 (select v_main_a_1053 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:32:39,463 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:32:39,541 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:39,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:39,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:39,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:39,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:39,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,590 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:39,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:39,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:39,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:39,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1054]. (let ((.cse2 (select v_main_a_1054 main_y))) (let ((.cse0 (= (store v_main_a_1054 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1054 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 24) (= .cse2 977))))) [2019-05-15 10:32:39,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:39,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:39,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:39,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:39,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:39,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,796 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:39,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:39,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:39,805 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:39,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1055]. (let ((.cse1 (select v_main_a_1055 main_x))) (let ((.cse0 (= main_a (store v_main_a_1055 main_x (+ .cse1 1))))) (or (and .cse0 (= 24 .cse1) (= 976 (select v_main_a_1055 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:32:39,806 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:32:39,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:39,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:39,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:39,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:39,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:39,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:39,935 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:39,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:39,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:39,994 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:39,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1056]. (let ((.cse2 (select v_main_a_1056 main_y))) (let ((.cse1 (select v_main_a_1056 main_x)) (.cse0 (= (store v_main_a_1056 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 976) (= .cse1 25) .cse0)))) [2019-05-15 10:32:39,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:40,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:40,097 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:40,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:40,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:40,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,128 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:40,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:40,129 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:40,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:40,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1057]. (let ((.cse0 (select v_main_a_1057 main_x))) (let ((.cse1 (= (store v_main_a_1057 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 25) (= (select v_main_a_1057 main_y) 975) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:40,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:32:40,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:40,244 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:40,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:40,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:40,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,276 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:40,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:40,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:40,320 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:40,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1058]. (let ((.cse1 (select v_main_a_1058 main_y))) (let ((.cse2 (= (store v_main_a_1058 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1058 main_x))) (or (and (= .cse0 26) (= .cse1 975) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:32:40,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:40,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:40,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:40,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:40,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:40,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,458 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:40,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:40,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:40,470 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:40,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1059]. (let ((.cse1 (select v_main_a_1059 main_x))) (let ((.cse0 (= main_a (store v_main_a_1059 main_x (+ .cse1 1))))) (or (and .cse0 (= 26 .cse1) (= 974 (select v_main_a_1059 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:32:40,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:32:40,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:40,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:40,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:40,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:40,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:40,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,606 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:40,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:40,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:40,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:40,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1060]. (let ((.cse2 (select v_main_a_1060 main_y))) (let ((.cse0 (select v_main_a_1060 main_x)) (.cse1 (= (store v_main_a_1060 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 974) (= .cse0 27) .cse1)))) [2019-05-15 10:32:40,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:40,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:40,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:40,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:40,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:40,788 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,813 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:40,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:40,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:40,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:40,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1061]. (let ((.cse0 (select v_main_a_1061 main_x))) (let ((.cse1 (= (store v_main_a_1061 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 27) .cse1 (= (select v_main_a_1061 main_y) 973)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:32:40,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:32:40,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:40,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:40,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:40,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:40,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:40,966 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:40,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:40,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:41,004 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:41,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1062]. (let ((.cse0 (select v_main_a_1062 main_y))) (let ((.cse1 (select v_main_a_1062 main_x)) (.cse2 (= main_a (store v_main_a_1062 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 973) (= .cse1 28) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:32:41,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:41,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:41,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:41,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:41,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:41,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,152 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:41,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:41,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:41,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:41,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1063]. (let ((.cse0 (select v_main_a_1063 main_x))) (let ((.cse1 (= (store v_main_a_1063 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1063 main_y) 972) (= .cse0 28) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:41,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:32:41,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:41,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:41,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:41,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:41,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:41,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,304 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:41,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:41,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:41,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:41,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1064]. (let ((.cse2 (select v_main_a_1064 main_y))) (let ((.cse0 (= (store v_main_a_1064 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1064 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 972) (= .cse1 29))))) [2019-05-15 10:32:41,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:41,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:41,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:41,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:41,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:41,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,528 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:41,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:41,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:41,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:41,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1065]. (let ((.cse1 (select v_main_a_1065 main_x))) (let ((.cse0 (= (store v_main_a_1065 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1065 main_y) 971) .cse0 (= .cse1 29)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:32:41,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:32:41,633 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:41,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:41,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:41,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,655 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:41,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:41,657 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,691 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:41,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:41,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:41,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:41,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1066]. (let ((.cse2 (select v_main_a_1066 main_y))) (let ((.cse0 (select v_main_a_1066 main_x)) (.cse1 (= main_a (store v_main_a_1066 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 30) (= .cse2 971) .cse1)))) [2019-05-15 10:32:41,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:41,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:41,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:41,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:41,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:41,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:41,878 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:41,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:41,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:41,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:41,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1067]. (let ((.cse0 (select v_main_a_1067 main_x))) (let ((.cse1 (= (store v_main_a_1067 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1067 main_y) 970) (= .cse0 30) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:32:41,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:32:41,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:41,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:41,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:41,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:42,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,045 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:42,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:42,045 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:42,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1068]. (let ((.cse2 (select v_main_a_1068 main_y))) (let ((.cse1 (= (store v_main_a_1068 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1068 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 970) .cse1 (= .cse0 31))))) [2019-05-15 10:32:42,115 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:42,214 INFO L273 TraceCheckUtils]: 0: Hoare triple {8788#true} a := a[x := 0]; {8793#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:32:42,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {8793#(= (select main_a main_x) 0)} a := a[y := 1000]; {8797#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:32:42,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {8797#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {8801#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:32:42,217 INFO L273 TraceCheckUtils]: 3: Hoare triple {8801#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {8805#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,218 INFO L273 TraceCheckUtils]: 4: Hoare triple {8805#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8809#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:32:42,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {8809#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {8813#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {8813#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8817#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:32:42,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {8817#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {8821#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {8821#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8825#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:32:42,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {8825#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {8829#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {8829#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8833#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:32:42,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {8833#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {8837#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {8837#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8841#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:32:42,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {8841#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {8845#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:32:42,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {8845#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {8849#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:32:42,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {8849#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {8853#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:32:42,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {8853#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {8857#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:32:42,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {8857#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {8861#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:32:42,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {8861#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {8865#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:32:42,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {8865#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {8869#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {8869#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8873#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:32:42,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {8873#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {8877#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {8877#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8881#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:32:42,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {8881#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {8885#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:32:42,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {8885#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {8889#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:32:42,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {8889#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {8893#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {8893#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8897#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:32:42,245 INFO L273 TraceCheckUtils]: 27: Hoare triple {8897#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {8901#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {8901#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8905#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:32:42,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {8905#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {8909#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:32:42,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {8909#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {8913#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:32:42,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {8913#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {8917#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {8917#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8921#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:32:42,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {8921#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {8925#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,254 INFO L273 TraceCheckUtils]: 34: Hoare triple {8925#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8929#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:32:42,255 INFO L273 TraceCheckUtils]: 35: Hoare triple {8929#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {8933#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:32:42,256 INFO L273 TraceCheckUtils]: 36: Hoare triple {8933#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {8937#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:32:42,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {8937#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {8941#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,258 INFO L273 TraceCheckUtils]: 38: Hoare triple {8941#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8945#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:32:42,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {8945#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {8949#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:32:42,261 INFO L273 TraceCheckUtils]: 40: Hoare triple {8949#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {8953#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:32:42,262 INFO L273 TraceCheckUtils]: 41: Hoare triple {8953#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {8957#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {8957#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8961#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:32:42,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {8961#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {8965#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {8965#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8969#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:32:42,267 INFO L273 TraceCheckUtils]: 45: Hoare triple {8969#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {8973#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:32:42,268 INFO L273 TraceCheckUtils]: 46: Hoare triple {8973#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {8977#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:32:42,269 INFO L273 TraceCheckUtils]: 47: Hoare triple {8977#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {8981#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {8981#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8985#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:32:42,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {8985#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {8989#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {8989#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {8993#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:32:42,274 INFO L273 TraceCheckUtils]: 51: Hoare triple {8993#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {8997#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,275 INFO L273 TraceCheckUtils]: 52: Hoare triple {8997#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9001#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:32:42,276 INFO L273 TraceCheckUtils]: 53: Hoare triple {9001#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {9005#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,277 INFO L273 TraceCheckUtils]: 54: Hoare triple {9005#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9009#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:32:42,279 INFO L273 TraceCheckUtils]: 55: Hoare triple {9009#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {9013#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,280 INFO L273 TraceCheckUtils]: 56: Hoare triple {9013#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9017#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:32:42,281 INFO L273 TraceCheckUtils]: 57: Hoare triple {9017#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {9021#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,282 INFO L273 TraceCheckUtils]: 58: Hoare triple {9021#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9025#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:32:42,283 INFO L273 TraceCheckUtils]: 59: Hoare triple {9025#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {9029#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,284 INFO L273 TraceCheckUtils]: 60: Hoare triple {9029#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9033#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:32:42,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {9033#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {9037#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,287 INFO L273 TraceCheckUtils]: 62: Hoare triple {9037#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9041#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:32:42,288 INFO L273 TraceCheckUtils]: 63: Hoare triple {9041#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {9045#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:32:42,289 INFO L273 TraceCheckUtils]: 64: Hoare triple {9045#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {8789#false} is VALID [2019-05-15 10:32:42,289 INFO L273 TraceCheckUtils]: 65: Hoare triple {8789#false} assume !(a[y] <= 0); {8789#false} is VALID [2019-05-15 10:32:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:42,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:42,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-15 10:32:42,307 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-05-15 10:32:42,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:42,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2019-05-15 10:32:42,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:42,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-05-15 10:32:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-15 10:32:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-05-15 10:32:42,411 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-05-15 10:32:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:53,192 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:32:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-15 10:32:53,192 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-05-15 10:32:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-05-15 10:32:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-05-15 10:32:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-05-15 10:32:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-05-15 10:32:53,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2019-05-15 10:32:53,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:53,289 INFO L225 Difference]: With dead ends: 69 [2019-05-15 10:32:53,289 INFO L226 Difference]: Without dead ends: 69 [2019-05-15 10:32:53,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-05-15 10:32:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-05-15 10:32:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-05-15 10:32:53,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:53,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2019-05-15 10:32:53,292 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2019-05-15 10:32:53,292 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2019-05-15 10:32:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:53,293 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:32:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:32:53,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:53,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:53,294 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2019-05-15 10:32:53,294 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2019-05-15 10:32:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:53,295 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:32:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:32:53,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:53,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:53,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:53,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-05-15 10:32:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-05-15 10:32:53,297 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-05-15 10:32:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:53,297 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-05-15 10:32:53,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-05-15 10:32:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:32:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-05-15 10:32:53,298 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:53,298 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-05-15 10:32:53,299 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:53,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1298488483, now seen corresponding path program 32 times [2019-05-15 10:32:53,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:53,375 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-15 10:32:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:53,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:53,484 INFO L375 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 6 treesize of output 5 [2019-05-15 10:32:53,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:53,508 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1069]. (= (store v_main_a_1069 main_x 0) main_a) [2019-05-15 10:32:53,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:32:53,531 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:32:53,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,547 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:32:53,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:32:53,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1070]. (and (= 0 (select v_main_a_1070 main_x)) (= (store v_main_a_1070 main_y 1000) main_a)) [2019-05-15 10:32:53,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:32:53,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:53,595 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:53,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:53,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,628 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:53,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:53,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:53,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1071]. (let ((.cse2 (select v_main_a_1071 main_x))) (let ((.cse0 (= 1000 (select v_main_a_1071 main_y))) (.cse1 (= (store v_main_a_1071 main_x (+ .cse2 1)) main_a))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= main_y main_x) .cse0 .cse1)))) [2019-05-15 10:32:53,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:32:53,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:53,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:53,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:53,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:53,692 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,718 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:53,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:53,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:53,737 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1072]. (let ((.cse2 (select v_main_a_1072 main_y))) (let ((.cse0 (select v_main_a_1072 main_x)) (.cse1 (= (store v_main_a_1072 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 1000) (= .cse0 1) .cse1)))) [2019-05-15 10:32:53,738 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:53,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:53,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:53,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:53,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,830 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:53,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:53,831 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:53,840 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1073]. (let ((.cse1 (select v_main_a_1073 main_x))) (let ((.cse0 (= (store v_main_a_1073 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1073 main_y) 999) (= .cse1 1)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:32:53,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:32:53,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:53,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:53,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:53,899 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,936 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:53,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:53,937 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:53,967 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1074]. (let ((.cse2 (select v_main_a_1074 main_y))) (let ((.cse0 (= (store v_main_a_1074 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1074 main_x))) (or (and .cse0 (= .cse1 2) (= 999 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:32:53,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:54,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:54,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,051 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:54,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1075]. (let ((.cse0 (select v_main_a_1075 main_x))) (let ((.cse1 (= (store v_main_a_1075 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 2) (= (select v_main_a_1075 main_y) 998) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:54,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:32:54,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:54,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,152 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:54,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,197 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1076]. (let ((.cse1 (select v_main_a_1076 main_y))) (let ((.cse0 (= main_a (store v_main_a_1076 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_1076 main_x))) (or (and .cse0 (= .cse1 998) (= 3 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:32:54,197 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:54,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:54,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,283 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:54,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,296 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1077]. (let ((.cse1 (select v_main_a_1077 main_x))) (let ((.cse0 (= (store v_main_a_1077 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1077 main_y) 997) (= .cse1 3))))) [2019-05-15 10:32:54,296 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:32:54,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:54,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,394 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:54,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1078]. (let ((.cse1 (select v_main_a_1078 main_y))) (let ((.cse0 (select v_main_a_1078 main_x)) (.cse2 (= (store v_main_a_1078 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 4) (= .cse1 997) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:32:54,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:54,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:54,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,499 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,535 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:54,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1079]. (let ((.cse1 (select v_main_a_1079 main_x))) (let ((.cse0 (= main_a (store v_main_a_1079 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1079 main_y) 996) (= .cse1 4))))) [2019-05-15 10:32:54,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:32:54,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:54,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:54,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,636 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,636 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:54,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1080]. (let ((.cse2 (select v_main_a_1080 main_y))) (let ((.cse0 (= (store v_main_a_1080 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1080 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 996 .cse2) (= 5 .cse1))))) [2019-05-15 10:32:54,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:54,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:54,745 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,770 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,771 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:54,781 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1081]. (let ((.cse0 (select v_main_a_1081 main_x))) (let ((.cse1 (= (store v_main_a_1081 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 5) .cse1 (= (select v_main_a_1081 main_y) 995)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:32:54,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:32:54,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:54,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:54,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,884 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:54,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,905 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1082]. (let ((.cse2 (select v_main_a_1082 main_y))) (let ((.cse0 (= (store v_main_a_1082 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1082 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= 995 .cse2) (= .cse1 6))))) [2019-05-15 10:32:54,905 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:54,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:54,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:54,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,969 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:54,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,996 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:54,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:54,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1083]. (let ((.cse1 (select v_main_a_1083 main_x))) (let ((.cse0 (= (store v_main_a_1083 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_1083 main_y) 994) (= 6 .cse1))))) [2019-05-15 10:32:55,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:32:55,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:55,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:55,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:55,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,100 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:55,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:55,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1084]. (let ((.cse2 (select v_main_a_1084 main_y))) (let ((.cse1 (select v_main_a_1084 main_x)) (.cse0 (= (store v_main_a_1084 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 7 .cse1) (= 994 .cse2)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:32:55,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:32:55,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:55,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:55,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:55,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,205 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:55,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:55,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1085]. (let ((.cse0 (select v_main_a_1085 main_x))) (let ((.cse1 (= (store v_main_a_1085 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_1085 main_y) 993) (= 7 .cse0) .cse1)))) [2019-05-15 10:32:55,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:32:55,261 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:55,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:55,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:55,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:55,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,310 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:55,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:55,310 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1086]. (let ((.cse2 (select v_main_a_1086 main_y))) (let ((.cse1 (select v_main_a_1086 main_x)) (.cse0 (= main_a (store v_main_a_1086 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 8) .cse0 (= 993 .cse2))))) [2019-05-15 10:32:55,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:32:55,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:55,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:55,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:55,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,419 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:55,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:55,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1087]. (let ((.cse0 (select v_main_a_1087 main_x))) (let ((.cse1 (= (store v_main_a_1087 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 8) .cse1 (= (select v_main_a_1087 main_y) 992)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:32:55,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:32:55,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:55,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:55,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:55,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,533 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:55,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:55,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1088]. (let ((.cse0 (select v_main_a_1088 main_y))) (let ((.cse1 (= (store v_main_a_1088 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1088 main_x))) (or (and (= 992 .cse0) .cse1 (= 9 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:32:55,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:32:55,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:55,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:55,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:55,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,654 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:55,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:55,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1089]. (let ((.cse1 (select v_main_a_1089 main_x))) (let ((.cse0 (= (store v_main_a_1089 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1089 main_y) 991) (= .cse1 9))))) [2019-05-15 10:32:55,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:32:55,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:55,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:55,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:55,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,785 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:55,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:55,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1090]. (let ((.cse0 (select v_main_a_1090 main_y))) (let ((.cse1 (select v_main_a_1090 main_x)) (.cse2 (= (store v_main_a_1090 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 991) (= .cse1 10) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:32:55,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:55,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:55,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:55,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:55,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,936 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:55,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:55,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:55,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1091]. (let ((.cse0 (select v_main_a_1091 main_x))) (let ((.cse1 (= (store v_main_a_1091 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1091 main_y) 990) (= .cse0 10) .cse1)))) [2019-05-15 10:32:55,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:32:56,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:56,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:56,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:56,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:56,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,054 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:56,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:56,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:56,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1092]. (let ((.cse2 (select v_main_a_1092 main_y))) (let ((.cse1 (= (store v_main_a_1092 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1092 main_x))) (or (and (= .cse0 11) .cse1 (= .cse2 990)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:32:56,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:32:56,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:56,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:56,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:56,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:56,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,168 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:56,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:56,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:56,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1093]. (let ((.cse1 (select v_main_a_1093 main_x))) (let ((.cse0 (= main_a (store v_main_a_1093 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 11) .cse0 (= 989 (select v_main_a_1093 main_y)))))) [2019-05-15 10:32:56,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:32:56,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:56,257 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:56,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:56,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:56,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,291 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:56,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:56,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:56,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1094]. (let ((.cse2 (select v_main_a_1094 main_y))) (let ((.cse0 (select v_main_a_1094 main_x)) (.cse1 (= main_a (store v_main_a_1094 main_y (+ .cse2 (- 1)))))) (or (and (= 12 .cse0) .cse1 (= 989 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:32:56,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:56,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:56,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:56,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:56,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:56,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,459 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:56,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:56,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:56,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1095]. (let ((.cse1 (select v_main_a_1095 main_x))) (let ((.cse0 (= (store v_main_a_1095 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 12 .cse1) (= 988 (select v_main_a_1095 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:32:56,468 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:32:56,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:56,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:56,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:56,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:56,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:56,552 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,586 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:56,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:56,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:56,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1096]. (let ((.cse2 (select v_main_a_1096 main_y))) (let ((.cse1 (= main_a (store v_main_a_1096 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1096 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 988) .cse1 (= .cse0 13))))) [2019-05-15 10:32:56,596 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:56,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:56,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:56,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:56,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:56,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,704 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:56,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:56,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:56,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1097]. (let ((.cse1 (select v_main_a_1097 main_x))) (let ((.cse0 (= main_a (store v_main_a_1097 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 13 .cse1) (= 987 (select v_main_a_1097 main_y)))))) [2019-05-15 10:32:56,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:32:56,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:56,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:56,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:56,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:56,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,843 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:56,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:56,843 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:56,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1098]. (let ((.cse2 (select v_main_a_1098 main_y))) (let ((.cse0 (select v_main_a_1098 main_x)) (.cse1 (= (store v_main_a_1098 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 14) .cse1 (= .cse2 987)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:32:56,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:32:56,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:56,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:56,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:56,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:56,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:56,964 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:56,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:56,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:56,977 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1099]. (let ((.cse0 (select v_main_a_1099 main_x))) (let ((.cse1 (= main_a (store v_main_a_1099 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 14 .cse0) (= 986 (select v_main_a_1099 main_y)) .cse1)))) [2019-05-15 10:32:56,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:32:57,042 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:57,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:57,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:57,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,064 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:57,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:57,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,090 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:57,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:57,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:57,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:57,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1100]. (let ((.cse2 (select v_main_a_1100 main_y))) (let ((.cse0 (select v_main_a_1100 main_x)) (.cse1 (= (store v_main_a_1100 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 15) (= .cse2 986) .cse1)))) [2019-05-15 10:32:57,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:57,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:57,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:57,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:57,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:57,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,238 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:57,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:57,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:57,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:57,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1101]. (let ((.cse0 (select v_main_a_1101 main_x))) (let ((.cse1 (= (store v_main_a_1101 main_x (+ .cse0 1)) main_a))) (or (and (= 15 .cse0) (= 985 (select v_main_a_1101 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:32:57,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:32:57,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:57,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:57,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:57,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:57,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,383 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:57,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:57,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:57,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:57,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1102]. (let ((.cse1 (select v_main_a_1102 main_y))) (let ((.cse0 (select v_main_a_1102 main_x)) (.cse2 (= (store v_main_a_1102 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 16) (= .cse1 985) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:32:57,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:57,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:57,510 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:57,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:57,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:57,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,544 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:57,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:57,544 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:57,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:57,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1103]. (let ((.cse1 (select v_main_a_1103 main_x))) (let ((.cse0 (= (store v_main_a_1103 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1103 main_y) 984) (= .cse1 16)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:32:57,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:32:57,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:57,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:57,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:57,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:57,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:57,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,673 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:57,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:57,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:57,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:57,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1104]. (let ((.cse2 (select v_main_a_1104 main_y))) (let ((.cse0 (= (store v_main_a_1104 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1104 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 984) (= .cse1 17))))) [2019-05-15 10:32:57,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:32:57,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:57,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:57,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:57,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:57,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,806 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:57,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:57,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:57,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:57,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1105]. (let ((.cse0 (select v_main_a_1105 main_x))) (let ((.cse1 (= (store v_main_a_1105 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 17 .cse0) (= (select v_main_a_1105 main_y) 983) .cse1)))) [2019-05-15 10:32:57,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:32:57,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:57,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:57,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:57,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:57,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:57,953 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:57,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:57,954 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:58,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:58,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1106]. (let ((.cse2 (select v_main_a_1106 main_y))) (let ((.cse0 (= (store v_main_a_1106 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1106 main_x))) (or (and .cse0 (= .cse1 18) (= .cse2 983)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:32:58,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:58,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:58,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:58,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:58,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:58,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,140 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:58,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:58,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:58,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:58,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1107]. (let ((.cse1 (select v_main_a_1107 main_x))) (let ((.cse0 (= (store v_main_a_1107 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1107 main_y) 982) (= .cse1 18)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:32:58,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:32:58,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:58,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:58,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:58,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:58,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,358 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:58,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:58,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:58,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:58,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1108]. (let ((.cse2 (select v_main_a_1108 main_y))) (let ((.cse0 (= (store v_main_a_1108 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1108 main_x))) (or (and .cse0 (= 19 .cse1) (= 982 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse1))))) [2019-05-15 10:32:58,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:32:58,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:58,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:58,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,467 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:58,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:58,469 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,494 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:58,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:58,495 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:58,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:58,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1109]. (let ((.cse0 (select v_main_a_1109 main_x))) (let ((.cse1 (= (store v_main_a_1109 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 19) (= (select v_main_a_1109 main_y) 981) .cse1)))) [2019-05-15 10:32:58,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:32:58,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:58,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:58,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:58,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:58,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:58,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,646 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:58,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:58,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:58,708 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:58,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1110]. (let ((.cse2 (select v_main_a_1110 main_y))) (let ((.cse0 (= (store v_main_a_1110 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1110 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= .cse2 981) .cse0 (= 20 .cse1))))) [2019-05-15 10:32:58,709 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:58,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:58,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:58,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:58,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:58,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,837 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:58,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:58,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:58,849 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:58,849 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1111]. (let ((.cse0 (select v_main_a_1111 main_x))) (let ((.cse1 (= main_a (store v_main_a_1111 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1111 main_y) 980) .cse1 (= .cse0 20))))) [2019-05-15 10:32:58,849 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:32:58,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:58,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:58,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:58,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:58,959 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:58,984 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:58,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:58,985 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:59,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:59,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1112]. (let ((.cse1 (select v_main_a_1112 main_y))) (let ((.cse0 (= (store v_main_a_1112 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1112 main_x))) (or (and .cse0 (= .cse1 980) (= .cse2 21)) (and .cse0 (= main_y main_x) (= .cse2 1001))))) [2019-05-15 10:32:59,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:59,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:59,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:59,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:59,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:59,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,214 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:59,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:59,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:59,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:59,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1113]. (let ((.cse1 (select v_main_a_1113 main_x))) (let ((.cse0 (= (store v_main_a_1113 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 21) (= (select v_main_a_1113 main_y) 979))))) [2019-05-15 10:32:59,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:32:59,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:59,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:59,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:59,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:59,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:59,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,418 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:59,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:59,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:59,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:59,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1114]. (let ((.cse2 (select v_main_a_1114 main_y))) (let ((.cse0 (select v_main_a_1114 main_x)) (.cse1 (= (store v_main_a_1114 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 979) (= .cse0 22) .cse1)))) [2019-05-15 10:32:59,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:32:59,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:59,525 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:59,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:59,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:59,531 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,556 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:59,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:59,556 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:59,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:59,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1115]. (let ((.cse0 (select v_main_a_1115 main_x))) (let ((.cse1 (= (store v_main_a_1115 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1115 main_y) 978) (= .cse0 22) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:59,569 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:32:59,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:32:59,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:59,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:32:59,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:59,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:59,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,705 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:59,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:59,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:59,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:59,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1116]. (let ((.cse2 (select v_main_a_1116 main_y))) (let ((.cse1 (select v_main_a_1116 main_x)) (.cse0 (= main_a (store v_main_a_1116 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 978) (= .cse1 23) .cse0)))) [2019-05-15 10:32:59,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:32:59,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:32:59,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:59,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:32:59,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:32:59,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:59,945 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:32:59,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:32:59,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:32:59,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:59,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1117]. (let ((.cse0 (select v_main_a_1117 main_x))) (let ((.cse1 (= main_a (store v_main_a_1117 main_x (+ .cse0 1))))) (or (and (= .cse0 23) .cse1 (= (select v_main_a_1117 main_y) 977)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:32:59,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:33:00,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:00,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:00,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:00,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:00,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:00,068 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,092 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:00,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:00,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:00,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:00,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1118]. (let ((.cse2 (select v_main_a_1118 main_y))) (let ((.cse0 (= (store v_main_a_1118 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1118 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 977) .cse0 (= .cse1 24))))) [2019-05-15 10:33:00,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:00,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:00,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:00,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,287 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:00,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:00,289 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,324 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:00,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:00,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:00,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:00,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1119]. (let ((.cse0 (select v_main_a_1119 main_x))) (let ((.cse1 (= (store v_main_a_1119 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1119 main_y) 976) (= .cse0 24) .cse1)))) [2019-05-15 10:33:00,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:33:00,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:00,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:00,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:00,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:00,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,466 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:00,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:00,466 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:00,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:00,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1120]. (let ((.cse1 (select v_main_a_1120 main_y))) (let ((.cse0 (= (store v_main_a_1120 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1120 main_x))) (or (and .cse0 (= .cse1 976) (= .cse2 25)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:33:00,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:00,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:00,715 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:00,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:00,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:00,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,747 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:00,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:00,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:00,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:00,759 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1121]. (let ((.cse1 (select v_main_a_1121 main_x))) (let ((.cse0 (= main_a (store v_main_a_1121 main_x (+ .cse1 1))))) (or (and .cse0 (= 25 .cse1) (= 975 (select v_main_a_1121 main_y))) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:33:00,759 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:33:00,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:00,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:00,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:00,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:00,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:00,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:00,903 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:00,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:00,903 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:00,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:00,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1122]. (let ((.cse2 (select v_main_a_1122 main_y))) (let ((.cse0 (select v_main_a_1122 main_x)) (.cse1 (= main_a (store v_main_a_1122 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 26) (= .cse2 975) .cse1)))) [2019-05-15 10:33:00,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:01,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:01,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:01,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:01,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:01,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,089 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:01,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:01,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:01,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:01,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1123]. (let ((.cse1 (select v_main_a_1123 main_x))) (let ((.cse0 (= (store v_main_a_1123 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1123 main_y) 974) (= .cse1 26))))) [2019-05-15 10:33:01,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:33:01,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:01,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:01,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:01,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:01,215 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,239 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:01,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:01,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:01,309 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:01,309 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1124]. (let ((.cse0 (select v_main_a_1124 main_y))) (let ((.cse1 (= (store v_main_a_1124 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1124 main_x))) (or (and (= .cse0 974) .cse1 (= .cse2 27)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:33:01,309 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:01,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:01,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:01,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:01,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:01,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,451 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:01,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:01,452 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:01,463 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:01,463 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1125]. (let ((.cse1 (select v_main_a_1125 main_x))) (let ((.cse0 (= main_a (store v_main_a_1125 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1125 main_y) 973) (= 27 .cse1)) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:33:01,463 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:33:01,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:01,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:01,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:01,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:01,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,606 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:01,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:01,606 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:01,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:01,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1126]. (let ((.cse0 (select v_main_a_1126 main_y))) (let ((.cse1 (select v_main_a_1126 main_x)) (.cse2 (= (store v_main_a_1126 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 973) (= .cse1 28) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:33:01,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:01,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:01,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:01,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:01,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:01,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,804 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:01,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:01,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:01,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:01,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1127]. (let ((.cse1 (select v_main_a_1127 main_x))) (let ((.cse0 (= main_a (store v_main_a_1127 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1127 main_y) 972) .cse0 (= .cse1 28))))) [2019-05-15 10:33:01,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:33:01,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:01,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:01,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:01,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:01,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:01,960 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:01,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:01,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:02,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1128]. (let ((.cse2 (select v_main_a_1128 main_y))) (let ((.cse0 (= (store v_main_a_1128 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1128 main_x))) (or (and .cse0 (= .cse1 29) (= 972 .cse2)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:33:02,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:02,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:02,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:02,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:02,167 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,191 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:02,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:02,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:02,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1129]. (let ((.cse1 (select v_main_a_1129 main_x))) (let ((.cse0 (= (store v_main_a_1129 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 971 (select v_main_a_1129 main_y)) (= 29 .cse1))))) [2019-05-15 10:33:02,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:33:02,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:02,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:02,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:02,328 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,364 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:02,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:02,364 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:02,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1130]. (let ((.cse1 (select v_main_a_1130 main_y))) (let ((.cse0 (= (store v_main_a_1130 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1130 main_x))) (or (and .cse0 (= .cse1 971) (= 30 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:33:02,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:02,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:02,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:02,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:02,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,619 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:02,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:02,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:02,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1131]. (let ((.cse1 (select v_main_a_1131 main_x))) (let ((.cse0 (= (store v_main_a_1131 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= .cse1 30) (= (select v_main_a_1131 main_y) 970))))) [2019-05-15 10:33:02,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:33:02,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:02,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:02,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:02,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,791 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:02,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:02,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:02,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1132]. (let ((.cse1 (select v_main_a_1132 main_y))) (let ((.cse0 (= (store v_main_a_1132 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1132 main_x))) (or (and .cse0 (= .cse1 970) (= .cse2 31)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:33:02,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:02,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:02,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:02,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:02,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,006 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:03,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:03,007 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:03,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1133]. (let ((.cse0 (select v_main_a_1133 main_x))) (let ((.cse1 (= (store v_main_a_1133 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 31) (= 969 (select v_main_a_1133 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:03,018 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:33:03,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:03,138 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:03,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:03,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,171 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:03,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:03,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:03,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1134]. (let ((.cse1 (select v_main_a_1134 main_y))) (let ((.cse0 (select v_main_a_1134 main_x)) (.cse2 (= (store v_main_a_1134 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 32) (= 969 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:33:03,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:03,346 INFO L273 TraceCheckUtils]: 0: Hoare triple {9327#true} a := a[x := 0]; {9332#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:33:03,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {9332#(= (select main_a main_x) 0)} a := a[y := 1000]; {9336#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:33:03,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {9336#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {9340#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:33:03,350 INFO L273 TraceCheckUtils]: 3: Hoare triple {9340#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {9344#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,351 INFO L273 TraceCheckUtils]: 4: Hoare triple {9344#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9348#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:33:03,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {9348#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {9352#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {9352#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9356#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:33:03,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {9356#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {9360#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {9360#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9364#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:33:03,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {9364#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {9368#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {9368#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9372#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:33:03,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {9372#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {9376#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {9376#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9380#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:33:03,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {9380#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {9384#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:33:03,366 INFO L273 TraceCheckUtils]: 14: Hoare triple {9384#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {9388#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:33:03,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {9388#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {9392#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:33:03,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {9392#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {9396#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:33:03,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {9396#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {9400#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:33:03,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {9400#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {9404#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:33:03,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {9404#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {9408#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {9408#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9412#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:33:03,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {9412#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {9416#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {9416#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9420#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:33:03,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {9420#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {9424#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:33:03,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {9424#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {9428#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:33:03,380 INFO L273 TraceCheckUtils]: 25: Hoare triple {9428#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {9432#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {9432#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9436#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:33:03,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {9436#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {9440#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {9440#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9444#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:33:03,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {9444#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {9448#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:33:03,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {9448#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {9452#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:33:03,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {9452#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {9456#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,387 INFO L273 TraceCheckUtils]: 32: Hoare triple {9456#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9460#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:33:03,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {9460#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {9464#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,389 INFO L273 TraceCheckUtils]: 34: Hoare triple {9464#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9468#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:33:03,390 INFO L273 TraceCheckUtils]: 35: Hoare triple {9468#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {9472#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:33:03,391 INFO L273 TraceCheckUtils]: 36: Hoare triple {9472#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {9476#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:33:03,392 INFO L273 TraceCheckUtils]: 37: Hoare triple {9476#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {9480#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,394 INFO L273 TraceCheckUtils]: 38: Hoare triple {9480#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9484#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:33:03,395 INFO L273 TraceCheckUtils]: 39: Hoare triple {9484#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {9488#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:33:03,396 INFO L273 TraceCheckUtils]: 40: Hoare triple {9488#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {9492#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:33:03,397 INFO L273 TraceCheckUtils]: 41: Hoare triple {9492#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {9496#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,398 INFO L273 TraceCheckUtils]: 42: Hoare triple {9496#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9500#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:33:03,399 INFO L273 TraceCheckUtils]: 43: Hoare triple {9500#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {9504#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {9504#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9508#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:33:03,402 INFO L273 TraceCheckUtils]: 45: Hoare triple {9508#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {9512#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:33:03,403 INFO L273 TraceCheckUtils]: 46: Hoare triple {9512#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {9516#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:33:03,404 INFO L273 TraceCheckUtils]: 47: Hoare triple {9516#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {9520#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {9520#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9524#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:33:03,406 INFO L273 TraceCheckUtils]: 49: Hoare triple {9524#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {9528#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,407 INFO L273 TraceCheckUtils]: 50: Hoare triple {9528#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9532#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:33:03,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {9532#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {9536#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {9536#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9540#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:33:03,411 INFO L273 TraceCheckUtils]: 53: Hoare triple {9540#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {9544#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {9544#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9548#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:33:03,413 INFO L273 TraceCheckUtils]: 55: Hoare triple {9548#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {9552#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {9552#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9556#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:33:03,415 INFO L273 TraceCheckUtils]: 57: Hoare triple {9556#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {9560#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,416 INFO L273 TraceCheckUtils]: 58: Hoare triple {9560#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9564#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:33:03,417 INFO L273 TraceCheckUtils]: 59: Hoare triple {9564#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {9568#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,419 INFO L273 TraceCheckUtils]: 60: Hoare triple {9568#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9572#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:33:03,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {9572#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {9576#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,421 INFO L273 TraceCheckUtils]: 62: Hoare triple {9576#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9580#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:33:03,422 INFO L273 TraceCheckUtils]: 63: Hoare triple {9580#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {9584#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,423 INFO L273 TraceCheckUtils]: 64: Hoare triple {9584#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9588#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:33:03,424 INFO L273 TraceCheckUtils]: 65: Hoare triple {9588#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {9592#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:03,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {9592#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {9328#false} is VALID [2019-05-15 10:33:03,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {9328#false} assume !(a[y] <= 0); {9328#false} is VALID [2019-05-15 10:33:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:03,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:03,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-15 10:33:03,445 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-05-15 10:33:03,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:03,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states. [2019-05-15 10:33:03,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:03,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-05-15 10:33:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-15 10:33:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-05-15 10:33:03,553 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-05-15 10:33:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:15,025 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:33:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-15 10:33:15,025 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-05-15 10:33:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-05-15 10:33:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-05-15 10:33:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-05-15 10:33:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-05-15 10:33:15,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2019-05-15 10:33:15,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:15,116 INFO L225 Difference]: With dead ends: 71 [2019-05-15 10:33:15,116 INFO L226 Difference]: Without dead ends: 71 [2019-05-15 10:33:15,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-05-15 10:33:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-05-15 10:33:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-05-15 10:33:15,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:15,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:15,118 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:15,119 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:15,119 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:33:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:33:15,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:15,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:15,120 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:15,120 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:15,121 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:33:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:33:15,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:15,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:15,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:15,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-05-15 10:33:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-05-15 10:33:15,122 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-05-15 10:33:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:15,122 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-05-15 10:33:15,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-05-15 10:33:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:33:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-05-15 10:33:15,123 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:15,123 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-05-15 10:33:15,123 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1988204412, now seen corresponding path program 33 times [2019-05-15 10:33:15,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:15,212 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-15 10:33:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:15,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:15,334 INFO L375 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 6 treesize of output 5 [2019-05-15 10:33:15,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:15,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1135]. (= (store v_main_a_1135 main_x 0) main_a) [2019-05-15 10:33:15,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:33:15,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:33:15,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,479 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:33:15,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:33:15,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1136]. (and (= (store v_main_a_1136 main_y 1000) main_a) (= 0 (select v_main_a_1136 main_x))) [2019-05-15 10:33:15,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:33:15,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:15,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:15,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:15,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,553 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:15,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:15,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:15,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1137]. (let ((.cse1 (select v_main_a_1137 main_x))) (let ((.cse0 (= 1000 (select v_main_a_1137 main_y))) (.cse2 (= (store v_main_a_1137 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 0) .cse2) (and (= main_y main_x) .cse0 .cse2)))) [2019-05-15 10:33:15,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:33:15,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:15,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:15,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:15,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,688 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:15,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:15,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:15,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1138]. (let ((.cse0 (select v_main_a_1138 main_y))) (let ((.cse1 (select v_main_a_1138 main_x)) (.cse2 (= (store v_main_a_1138 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 1000) (= .cse1 1) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:33:15,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:15,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:15,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:15,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:15,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,806 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:15,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:15,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:15,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1139]. (let ((.cse0 (select v_main_a_1139 main_x))) (let ((.cse1 (= (store v_main_a_1139 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 1) (= (select v_main_a_1139 main_y) 999) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:15,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:33:15,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:15,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:15,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:15,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:15,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,910 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:15,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:15,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:15,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1140]. (let ((.cse2 (select v_main_a_1140 main_y))) (let ((.cse0 (= (store v_main_a_1140 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1140 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 2) (= 999 .cse2))))) [2019-05-15 10:33:15,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:15,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:15,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:15,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:16,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,025 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1141]. (let ((.cse0 (select v_main_a_1141 main_x))) (let ((.cse1 (= main_a (store v_main_a_1141 main_x (+ .cse0 1))))) (or (and (= .cse0 2) .cse1 (= (select v_main_a_1141 main_y) 998)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:33:16,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:33:16,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:16,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:16,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:16,097 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,122 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1142]. (let ((.cse1 (select v_main_a_1142 main_y))) (let ((.cse0 (select v_main_a_1142 main_x)) (.cse2 (= main_a (store v_main_a_1142 main_y (+ .cse1 (- 1)))))) (or (and (= .cse0 3) (= .cse1 998) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:33:16,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:16,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:16,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:16,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:16,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,237 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1143]. (let ((.cse0 (select v_main_a_1143 main_x))) (let ((.cse1 (= (store v_main_a_1143 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 3) (= (select v_main_a_1143 main_y) 997) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:16,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:33:16,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:16,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:16,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:16,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,346 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,386 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1144]. (let ((.cse0 (select v_main_a_1144 main_y))) (let ((.cse1 (select v_main_a_1144 main_x)) (.cse2 (= main_a (store v_main_a_1144 main_y (+ .cse0 (- 1)))))) (or (and (= 997 .cse0) (= 4 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:33:16,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:16,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:16,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:16,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:16,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,487 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,500 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1145]. (let ((.cse0 (select v_main_a_1145 main_x))) (let ((.cse1 (= (store v_main_a_1145 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1145 main_y) 996) (= 4 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:33:16,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:33:16,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:16,557 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:16,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:16,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,590 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1146]. (let ((.cse2 (select v_main_a_1146 main_y))) (let ((.cse1 (= (store v_main_a_1146 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1146 main_x))) (or (and (= .cse0 5) .cse1 (= .cse2 996)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:33:16,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:16,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:16,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:16,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:16,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,715 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,715 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,728 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,728 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1147]. (let ((.cse0 (select v_main_a_1147 main_x))) (let ((.cse1 (= (store v_main_a_1147 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1147 main_y) 995) (= .cse0 5) .cse1)))) [2019-05-15 10:33:16,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:33:16,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:16,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:16,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:16,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,852 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1148]. (let ((.cse2 (select v_main_a_1148 main_y))) (let ((.cse1 (= (store v_main_a_1148 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1148 main_x))) (or (and (= .cse0 6) .cse1 (= .cse2 995)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:33:16,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:16,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:16,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:16,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:16,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,974 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:16,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:16,974 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:16,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1149]. (let ((.cse0 (select v_main_a_1149 main_x))) (let ((.cse1 (= (store v_main_a_1149 main_x (+ .cse0 1)) main_a))) (or (and (= 994 (select v_main_a_1149 main_y)) (= .cse0 6) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:16,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:33:17,031 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:17,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:17,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:17,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,078 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:17,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:17,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:17,133 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,133 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1150]. (let ((.cse2 (select v_main_a_1150 main_y))) (let ((.cse1 (= (store v_main_a_1150 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1150 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 994 .cse2) .cse1 (= 7 .cse0))))) [2019-05-15 10:33:17,133 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:33:17,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:17,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:17,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,229 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:17,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:17,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:17,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1151]. (let ((.cse1 (select v_main_a_1151 main_x))) (let ((.cse0 (= (store v_main_a_1151 main_x (+ .cse1 1)) main_a))) (or (and (= 993 (select v_main_a_1151 main_y)) .cse0 (= .cse1 7)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:33:17,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:33:17,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:17,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:17,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:17,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,337 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:17,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:17,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:17,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1152]. (let ((.cse2 (select v_main_a_1152 main_y))) (let ((.cse1 (= main_a (store v_main_a_1152 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1152 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 993) (= .cse0 8))))) [2019-05-15 10:33:17,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:33:17,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:17,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:17,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,445 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:17,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:17,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:17,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1153]. (let ((.cse0 (select v_main_a_1153 main_x))) (let ((.cse1 (= (store v_main_a_1153 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_1153 main_y) 992) (= 8 .cse0) .cse1)))) [2019-05-15 10:33:17,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:33:17,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,527 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:17,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:17,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,560 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:17,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:17,561 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:17,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1154]. (let ((.cse0 (select v_main_a_1154 main_y))) (let ((.cse1 (= (store v_main_a_1154 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1154 main_x))) (or (and (= .cse0 992) .cse1 (= .cse2 9)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:33:17,574 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:33:17,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:17,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:17,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,689 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:17,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:17,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:17,698 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1155]. (let ((.cse0 (select v_main_a_1155 main_x))) (let ((.cse1 (= (store v_main_a_1155 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 9) .cse1 (= (select v_main_a_1155 main_y) 991)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:17,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:33:17,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:17,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:17,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:17,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,797 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:17,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:17,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:17,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1156]. (let ((.cse2 (select v_main_a_1156 main_y))) (let ((.cse0 (= (store v_main_a_1156 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1156 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 991) (= .cse1 10))))) [2019-05-15 10:33:17,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:17,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:17,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:17,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,928 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:17,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:17,928 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:17,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1157]. (let ((.cse0 (select v_main_a_1157 main_x))) (let ((.cse1 (= (store v_main_a_1157 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 10) (= (select v_main_a_1157 main_y) 990))))) [2019-05-15 10:33:17,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:33:17,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:17,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:17,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:17,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,017 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:18,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,045 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:18,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:18,045 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:18,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1158]. (let ((.cse2 (select v_main_a_1158 main_y))) (let ((.cse0 (= (store v_main_a_1158 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1158 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 990) .cse0 (= .cse1 11))))) [2019-05-15 10:33:18,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:33:18,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:18,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:18,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:18,132 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,156 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:18,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:18,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:18,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1159]. (let ((.cse1 (select v_main_a_1159 main_x))) (let ((.cse0 (= (store v_main_a_1159 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1159 main_y) 989) (= .cse1 11))))) [2019-05-15 10:33:18,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:33:18,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:18,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:18,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:18,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,281 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:18,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:18,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:18,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1160]. (let ((.cse0 (select v_main_a_1160 main_y))) (let ((.cse2 (select v_main_a_1160 main_x)) (.cse1 (= main_a (store v_main_a_1160 main_y (+ .cse0 (- 1)))))) (or (and (= 989 .cse0) .cse1 (= 12 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:33:18,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:18,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:18,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:18,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:18,415 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,453 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:18,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:18,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:18,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1161]. (let ((.cse0 (select v_main_a_1161 main_x))) (let ((.cse1 (= (store v_main_a_1161 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 12 .cse0) .cse1 (= 988 (select v_main_a_1161 main_y)))))) [2019-05-15 10:33:18,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:33:18,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:18,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:18,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:18,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:18,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,585 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:18,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:18,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:18,665 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,665 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1162]. (let ((.cse2 (select v_main_a_1162 main_y))) (let ((.cse0 (= (store v_main_a_1162 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1162 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 988) .cse0 (= .cse1 13))))) [2019-05-15 10:33:18,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:18,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:18,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:18,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:18,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,779 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:18,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:18,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:18,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1163]. (let ((.cse0 (select v_main_a_1163 main_x))) (let ((.cse1 (= main_a (store v_main_a_1163 main_x (+ .cse0 1))))) (or (and (= 987 (select v_main_a_1163 main_y)) (= 13 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:33:18,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:33:18,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:18,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:18,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:18,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:18,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,941 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:18,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:18,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:18,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1164]. (let ((.cse2 (select v_main_a_1164 main_y))) (let ((.cse0 (= (store v_main_a_1164 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1164 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 987) .cse0 (= .cse1 14))))) [2019-05-15 10:33:18,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:33:19,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:19,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:19,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:19,045 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,073 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:19,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:19,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:19,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1165]. (let ((.cse0 (select v_main_a_1165 main_x))) (let ((.cse1 (= (store v_main_a_1165 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 14) .cse1 (= (select v_main_a_1165 main_y) 986)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:19,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:33:19,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:19,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:19,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:19,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,200 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:19,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:19,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:19,263 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,263 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1166]. (let ((.cse0 (select v_main_a_1166 main_y))) (let ((.cse2 (select v_main_a_1166 main_x)) (.cse1 (= (store v_main_a_1166 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 986) .cse1 (= .cse2 15)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:33:19,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:19,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:19,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:19,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:19,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,382 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:19,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:19,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:19,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1167]. (let ((.cse0 (select v_main_a_1167 main_x))) (let ((.cse1 (= (store v_main_a_1167 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 15) (= (select v_main_a_1167 main_y) 985) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:33:19,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:33:19,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:19,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:19,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:19,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,519 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:19,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:19,520 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:19,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1168]. (let ((.cse2 (select v_main_a_1168 main_y))) (let ((.cse0 (= main_a (store v_main_a_1168 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1168 main_x))) (or (and .cse0 (= .cse1 16) (= .cse2 985)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:33:19,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:19,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:19,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:19,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:19,658 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,682 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:19,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:19,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:19,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1169]. (let ((.cse0 (select v_main_a_1169 main_x))) (let ((.cse1 (= (store v_main_a_1169 main_x (+ .cse0 1)) main_a))) (or (and (= 16 .cse0) .cse1 (= (select v_main_a_1169 main_y) 984)) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:33:19,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:33:19,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:19,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:19,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:19,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,818 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:19,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:19,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:19,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1170]. (let ((.cse0 (select v_main_a_1170 main_y))) (let ((.cse1 (= (store v_main_a_1170 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1170 main_x))) (or (and (= .cse0 984) .cse1 (= .cse2 17)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:33:19,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:33:19,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:19,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:19,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:19,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,952 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:19,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:19,953 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:19,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1171]. (let ((.cse0 (select v_main_a_1171 main_x))) (let ((.cse1 (= (store v_main_a_1171 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1171 main_y) 983) .cse1 (= .cse0 17))))) [2019-05-15 10:33:19,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:33:20,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:20,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:20,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:20,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,061 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:20,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:20,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,098 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:20,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:20,099 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:20,126 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:20,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1172]. (let ((.cse2 (select v_main_a_1172 main_y))) (let ((.cse0 (= (store v_main_a_1172 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1172 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 18) (= .cse2 983))))) [2019-05-15 10:33:20,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:20,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:20,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:20,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:20,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:20,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,252 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:20,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:20,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:20,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:20,261 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1173]. (let ((.cse0 (select v_main_a_1173 main_x))) (let ((.cse1 (= (store v_main_a_1173 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1173 main_y) 982) (= 18 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:33:20,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:33:20,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:20,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:20,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:20,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,361 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:20,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:20,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,386 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:20,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:20,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:20,397 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:20,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1174]. (let ((.cse2 (select v_main_a_1174 main_y))) (let ((.cse0 (= (store v_main_a_1174 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1174 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 982) .cse0 (= .cse1 19))))) [2019-05-15 10:33:20,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:33:20,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:20,490 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:20,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:20,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:20,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,522 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:20,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:20,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:20,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:20,536 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1175]. (let ((.cse0 (select v_main_a_1175 main_x))) (let ((.cse1 (= main_a (store v_main_a_1175 main_x (+ .cse0 1))))) (or (and (= 19 .cse0) (= 981 (select v_main_a_1175 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:33:20,536 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:33:20,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:20,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:20,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:20,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:20,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:20,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,682 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:20,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:20,682 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:20,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:20,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1176]. (let ((.cse2 (select v_main_a_1176 main_y))) (let ((.cse0 (select v_main_a_1176 main_x)) (.cse1 (= (store v_main_a_1176 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 20) (= .cse2 981) .cse1)))) [2019-05-15 10:33:20,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:20,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:20,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:20,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:20,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:20,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:20,889 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:20,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:20,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:20,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:20,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1177]. (let ((.cse0 (select v_main_a_1177 main_x))) (let ((.cse1 (= (store v_main_a_1177 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 20 .cse0) (= (select v_main_a_1177 main_y) 980) .cse1)))) [2019-05-15 10:33:20,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:33:20,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:21,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:21,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:21,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:21,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,033 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:21,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:21,034 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:21,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:21,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1178]. (let ((.cse0 (select v_main_a_1178 main_y))) (let ((.cse2 (= main_a (store v_main_a_1178 main_y (+ .cse0 (- 1))))) (.cse1 (select v_main_a_1178 main_x))) (or (and (= .cse0 980) (= .cse1 21) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:33:21,080 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:21,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:21,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:21,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:21,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:21,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,220 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:21,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:21,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:21,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:21,232 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1179]. (let ((.cse1 (select v_main_a_1179 main_x))) (let ((.cse0 (= (store v_main_a_1179 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 21) (= (select v_main_a_1179 main_y) 979)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:33:21,232 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:33:21,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:21,336 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:21,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:21,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:21,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,371 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:21,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:21,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:21,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:21,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1180]. (let ((.cse1 (select v_main_a_1180 main_y))) (let ((.cse0 (= (store v_main_a_1180 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1180 main_x))) (or (and .cse0 (= .cse1 979) (= .cse2 22)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:33:21,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:33:21,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:21,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:21,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:21,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:21,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,530 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:21,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:21,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:21,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:21,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1181]. (let ((.cse1 (select v_main_a_1181 main_x))) (let ((.cse0 (= (store v_main_a_1181 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1181 main_y) 978) (= .cse1 22)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:33:21,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:33:21,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:21,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:21,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:21,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:21,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,680 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:21,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:21,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:21,755 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:21,755 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1182]. (let ((.cse1 (select v_main_a_1182 main_y))) (let ((.cse0 (select v_main_a_1182 main_x)) (.cse2 (= (store v_main_a_1182 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 23) (= .cse1 978) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:33:21,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:21,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:21,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:21,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:21,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:21,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:21,885 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:21,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:21,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:21,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:21,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1183]. (let ((.cse1 (select v_main_a_1183 main_x))) (let ((.cse0 (= (store v_main_a_1183 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 23) (= (select v_main_a_1183 main_y) 977)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:33:21,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:33:21,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:21,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:21,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:21,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:22,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,026 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:22,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:22,026 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:22,092 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:22,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1184]. (let ((.cse2 (select v_main_a_1184 main_y))) (let ((.cse0 (= (store v_main_a_1184 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1184 main_x))) (or (and .cse0 (= .cse1 24) (= .cse2 977)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:33:22,092 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:22,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:22,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:22,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:22,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:22,199 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,234 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:22,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:22,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:22,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:22,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1185]. (let ((.cse1 (select v_main_a_1185 main_x))) (let ((.cse0 (= (store v_main_a_1185 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1185 main_y) 976) .cse0 (= .cse1 24)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:33:22,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:33:22,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:22,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:22,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:22,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:22,354 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,378 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:22,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:22,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:22,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:22,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1186]. (let ((.cse2 (select v_main_a_1186 main_y))) (let ((.cse0 (= main_a (store v_main_a_1186 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1186 main_x))) (or (and .cse0 (= .cse1 25) (= 976 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:33:22,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:22,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:22,550 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:22,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:22,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:22,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,581 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:22,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:22,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:22,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:22,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1187]. (let ((.cse0 (select v_main_a_1187 main_x))) (let ((.cse1 (= main_a (store v_main_a_1187 main_x (+ .cse0 1))))) (or (and (= .cse0 25) (= (select v_main_a_1187 main_y) 975) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:22,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:33:22,680 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:22,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:22,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:22,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:22,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:22,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,737 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:22,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:22,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:22,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:22,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1188]. (let ((.cse2 (select v_main_a_1188 main_y))) (let ((.cse0 (select v_main_a_1188 main_x)) (.cse1 (= (store v_main_a_1188 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 26) (= .cse2 975) .cse1)))) [2019-05-15 10:33:22,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:22,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:22,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:22,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:22,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:22,915 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:22,939 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:22,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:22,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:22,951 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:22,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1189]. (let ((.cse1 (select v_main_a_1189 main_x))) (let ((.cse0 (= (store v_main_a_1189 main_x (+ .cse1 1)) main_a))) (or (and (= 974 (select v_main_a_1189 main_y)) .cse0 (= 26 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:33:22,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:33:23,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:23,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:23,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:23,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:23,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,090 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:23,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:23,090 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:23,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:23,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1190]. (let ((.cse1 (select v_main_a_1190 main_y))) (let ((.cse0 (select v_main_a_1190 main_x)) (.cse2 (= (store v_main_a_1190 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 27) (= .cse1 974) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:33:23,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:23,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:23,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:23,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:23,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:23,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,290 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:23,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:23,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:23,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:23,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1191]. (let ((.cse0 (select v_main_a_1191 main_x))) (let ((.cse1 (= (store v_main_a_1191 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 27) (= (select v_main_a_1191 main_y) 973) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:23,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:33:23,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:23,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:23,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:23,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:23,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:23,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,447 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:23,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:23,447 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:23,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:23,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1192]. (let ((.cse2 (select v_main_a_1192 main_y))) (let ((.cse0 (= (store v_main_a_1192 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1192 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 973) .cse0 (= .cse1 28))))) [2019-05-15 10:33:23,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:23,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:23,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:23,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:23,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:23,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,653 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:23,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:23,653 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:23,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:23,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1193]. (let ((.cse0 (select v_main_a_1193 main_x))) (let ((.cse1 (= (store v_main_a_1193 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1193 main_y) 972) (= .cse0 28) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:23,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:33:23,761 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:23,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:23,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:23,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:23,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:23,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:23,810 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:23,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:23,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:23,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:23,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1194]. (let ((.cse2 (select v_main_a_1194 main_y))) (let ((.cse1 (= (store v_main_a_1194 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1194 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 29) (= .cse2 972))))) [2019-05-15 10:33:23,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:23,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:23,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:23,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:23,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:24,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,026 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:24,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:24,026 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:24,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1195]. (let ((.cse1 (select v_main_a_1195 main_x))) (let ((.cse0 (= (store v_main_a_1195 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 29) (= 971 (select v_main_a_1195 main_y))) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:33:24,035 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:33:24,136 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:24,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:24,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:24,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:24,161 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,196 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:24,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:24,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:24,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,261 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1196]. (let ((.cse2 (select v_main_a_1196 main_y))) (let ((.cse0 (select v_main_a_1196 main_x)) (.cse1 (= (store v_main_a_1196 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 30 .cse0) .cse1 (= .cse2 971))))) [2019-05-15 10:33:24,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:24,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:24,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:24,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:24,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,417 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:24,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:24,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:24,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1197]. (let ((.cse1 (select v_main_a_1197 main_x))) (let ((.cse0 (= (store v_main_a_1197 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 30) (= 970 (select v_main_a_1197 main_y)) .cse0)))) [2019-05-15 10:33:24,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:33:24,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:24,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:24,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:24,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,591 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:24,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:24,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:24,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1198]. (let ((.cse2 (select v_main_a_1198 main_y))) (let ((.cse1 (= main_a (store v_main_a_1198 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1198 main_x))) (or (and (= .cse0 31) .cse1 (= .cse2 970)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:33:24,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:24,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:24,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:24,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:24,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,819 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:24,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:24,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:24,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1199]. (let ((.cse1 (select v_main_a_1199 main_x))) (let ((.cse0 (= (store v_main_a_1199 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1199 main_y) 969) (= .cse1 31)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:33:24,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:33:24,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:24,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:24,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:24,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,958 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:24,960 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,984 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:24,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:24,985 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:25,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1200]. (let ((.cse2 (select v_main_a_1200 main_y))) (let ((.cse0 (= (store v_main_a_1200 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1200 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 969) (= .cse1 32))))) [2019-05-15 10:33:25,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:25,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:25,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:25,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,155 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:25,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,193 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:25,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:25,194 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:25,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1201]. (let ((.cse0 (select v_main_a_1201 main_x))) (let ((.cse1 (= (store v_main_a_1201 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1201 main_y) 968) (= .cse0 32) .cse1)))) [2019-05-15 10:33:25,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:33:25,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:25,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:25,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:25,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,367 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:25,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:25,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:25,462 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1202]. (let ((.cse1 (select v_main_a_1202 main_y))) (let ((.cse0 (= (store v_main_a_1202 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1202 main_x))) (or (and .cse0 (= .cse1 968) (= .cse2 33)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:33:25,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:25,558 INFO L273 TraceCheckUtils]: 0: Hoare triple {9882#true} a := a[x := 0]; {9887#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:33:25,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {9887#(= (select main_a main_x) 0)} a := a[y := 1000]; {9891#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:33:25,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {9891#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {9895#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:33:25,561 INFO L273 TraceCheckUtils]: 3: Hoare triple {9895#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {9899#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,562 INFO L273 TraceCheckUtils]: 4: Hoare triple {9899#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9903#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:33:25,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {9903#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {9907#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {9907#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9911#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:33:25,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {9911#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {9915#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {9915#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9919#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:33:25,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {9919#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {9923#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {9923#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9927#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:33:25,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {9927#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {9931#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {9931#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9935#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:33:25,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {9935#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {9939#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:33:25,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {9939#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {9943#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:33:25,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {9943#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {9947#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:33:25,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {9947#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {9951#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:33:25,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {9951#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {9955#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:33:25,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {9955#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {9959#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:33:25,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {9959#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {9963#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {9963#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9967#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:33:25,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {9967#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {9971#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {9971#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9975#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:33:25,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {9975#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {9979#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:33:25,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {9979#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {9983#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:33:25,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {9983#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {9987#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {9987#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:33:25,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {9991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {9995#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {9995#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {9999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:33:25,591 INFO L273 TraceCheckUtils]: 29: Hoare triple {9999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {10003#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:33:25,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {10003#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {10007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:33:25,593 INFO L273 TraceCheckUtils]: 31: Hoare triple {10007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {10011#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {10011#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:33:25,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {10015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {10019#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {10019#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:33:25,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {10023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {10027#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:33:25,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {10027#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {10031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:33:25,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {10031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {10035#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {10035#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:33:25,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {10039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {10043#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:33:25,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {10043#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {10047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:33:25,604 INFO L273 TraceCheckUtils]: 41: Hoare triple {10047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {10051#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,605 INFO L273 TraceCheckUtils]: 42: Hoare triple {10051#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:33:25,607 INFO L273 TraceCheckUtils]: 43: Hoare triple {10055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {10059#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,608 INFO L273 TraceCheckUtils]: 44: Hoare triple {10059#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10063#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:33:25,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {10063#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {10067#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:33:25,610 INFO L273 TraceCheckUtils]: 46: Hoare triple {10067#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {10071#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:33:25,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {10071#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {10075#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {10075#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10079#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:33:25,613 INFO L273 TraceCheckUtils]: 49: Hoare triple {10079#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {10083#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,614 INFO L273 TraceCheckUtils]: 50: Hoare triple {10083#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10087#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:33:25,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {10087#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {10091#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,617 INFO L273 TraceCheckUtils]: 52: Hoare triple {10091#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10095#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:33:25,618 INFO L273 TraceCheckUtils]: 53: Hoare triple {10095#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {10099#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {10099#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10103#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:33:25,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {10103#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {10107#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {10107#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10111#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:33:25,622 INFO L273 TraceCheckUtils]: 57: Hoare triple {10111#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {10115#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,623 INFO L273 TraceCheckUtils]: 58: Hoare triple {10115#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10119#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:33:25,625 INFO L273 TraceCheckUtils]: 59: Hoare triple {10119#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {10123#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,626 INFO L273 TraceCheckUtils]: 60: Hoare triple {10123#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10127#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:33:25,627 INFO L273 TraceCheckUtils]: 61: Hoare triple {10127#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {10131#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,628 INFO L273 TraceCheckUtils]: 62: Hoare triple {10131#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10135#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:33:25,629 INFO L273 TraceCheckUtils]: 63: Hoare triple {10135#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {10139#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,630 INFO L273 TraceCheckUtils]: 64: Hoare triple {10139#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10143#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:33:25,632 INFO L273 TraceCheckUtils]: 65: Hoare triple {10143#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {10147#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,633 INFO L273 TraceCheckUtils]: 66: Hoare triple {10147#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10151#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:33:25,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {10151#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {10155#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:25,635 INFO L273 TraceCheckUtils]: 68: Hoare triple {10155#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {9883#false} is VALID [2019-05-15 10:33:25,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {9883#false} assume !(a[y] <= 0); {9883#false} is VALID [2019-05-15 10:33:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:25,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:25,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-15 10:33:25,654 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-05-15 10:33:25,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:25,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states. [2019-05-15 10:33:25,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:25,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-05-15 10:33:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-15 10:33:25,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-05-15 10:33:25,749 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-05-15 10:33:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:37,854 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:33:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-15 10:33:37,855 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-05-15 10:33:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-05-15 10:33:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-05-15 10:33:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-05-15 10:33:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-05-15 10:33:37,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2019-05-15 10:33:37,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:37,953 INFO L225 Difference]: With dead ends: 73 [2019-05-15 10:33:37,954 INFO L226 Difference]: Without dead ends: 73 [2019-05-15 10:33:37,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-05-15 10:33:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-05-15 10:33:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-05-15 10:33:37,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:37,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2019-05-15 10:33:37,956 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2019-05-15 10:33:37,956 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2019-05-15 10:33:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:37,956 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:33:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:33:37,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:37,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:37,957 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2019-05-15 10:33:37,957 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2019-05-15 10:33:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:37,958 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:33:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:33:37,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:37,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:37,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:37,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-05-15 10:33:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-05-15 10:33:37,960 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-05-15 10:33:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:37,960 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-05-15 10:33:37,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-05-15 10:33:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:33:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-05-15 10:33:37,961 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:37,961 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-05-15 10:33:37,961 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:37,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash 595853349, now seen corresponding path program 34 times [2019-05-15 10:33:37,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:38,052 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-15 10:33:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:38,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:38,131 INFO L375 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 6 treesize of output 5 [2019-05-15 10:33:38,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:38,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1203]. (= (store v_main_a_1203 main_x 0) main_a) [2019-05-15 10:33:38,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:33:38,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:33:38,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,229 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:33:38,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:33:38,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,232 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1204]. (and (= main_a (store v_main_a_1204 main_y 1000)) (= 0 (select v_main_a_1204 main_x))) [2019-05-15 10:33:38,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:33:38,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:38,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:38,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:38,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:38,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,302 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:38,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:38,303 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:38,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1205]. (let ((.cse2 (select v_main_a_1205 main_x))) (let ((.cse0 (= (store v_main_a_1205 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_1205 main_y) 1000))) (or (and .cse0 .cse1 (= main_y main_x)) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:33:38,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:33:38,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:38,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:38,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:38,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,390 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:38,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:38,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:38,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1206]. (let ((.cse1 (select v_main_a_1206 main_y))) (let ((.cse0 (select v_main_a_1206 main_x)) (.cse2 (= (store v_main_a_1206 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 1) (= .cse1 1000) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:33:38,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:38,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:38,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:38,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:38,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,494 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:38,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:38,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:38,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,507 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1207]. (let ((.cse0 (select v_main_a_1207 main_x))) (let ((.cse1 (= main_a (store v_main_a_1207 main_x (+ .cse0 1))))) (or (and (= .cse0 1) (= (select v_main_a_1207 main_y) 999) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:38,507 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:33:38,539 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:38,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:38,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:38,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:38,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,598 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:38,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:38,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:38,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1208]. (let ((.cse2 (select v_main_a_1208 main_y))) (let ((.cse0 (select v_main_a_1208 main_x)) (.cse1 (= (store v_main_a_1208 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 999 .cse2) (= .cse0 2) .cse1)))) [2019-05-15 10:33:38,615 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:38,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:38,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:38,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:38,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,705 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:38,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:38,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:38,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,718 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1209]. (let ((.cse0 (select v_main_a_1209 main_x))) (let ((.cse1 (= (store v_main_a_1209 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 2 .cse0) (= 998 (select v_main_a_1209 main_y)) .cse1)))) [2019-05-15 10:33:38,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:33:38,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:38,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:38,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:38,774 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,798 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:38,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:38,799 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:38,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1210]. (let ((.cse1 (select v_main_a_1210 main_y))) (let ((.cse0 (= (store v_main_a_1210 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1210 main_x))) (or (and .cse0 (= .cse1 998) (= .cse2 3)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:33:38,822 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:38,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:38,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:38,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,879 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:38,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,904 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:38,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:38,904 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:38,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1211]. (let ((.cse0 (select v_main_a_1211 main_x))) (let ((.cse1 (= (store v_main_a_1211 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 997 (select v_main_a_1211 main_y)) (= 3 .cse0) .cse1)))) [2019-05-15 10:33:38,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:33:38,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:38,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:38,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:38,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:38,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,998 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:38,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:38,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1212]. (let ((.cse2 (select v_main_a_1212 main_y))) (let ((.cse1 (= (store v_main_a_1212 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1212 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 4) (= .cse2 997))))) [2019-05-15 10:33:39,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:39,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:39,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:39,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:39,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,133 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:39,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:39,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1213]. (let ((.cse0 (select v_main_a_1213 main_x))) (let ((.cse1 (= (store v_main_a_1213 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1213 main_y) 996) (= .cse0 4) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:39,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:33:39,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:39,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:39,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:39,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,233 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:39,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:39,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1214]. (let ((.cse2 (select v_main_a_1214 main_y))) (let ((.cse0 (= (store v_main_a_1214 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1214 main_x))) (or (and .cse0 (= .cse1 5) (= .cse2 996)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:33:39,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:39,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:39,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:39,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:39,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,356 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:39,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:39,357 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1215]. (let ((.cse0 (select v_main_a_1215 main_x))) (let ((.cse1 (= (store v_main_a_1215 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 5) (= (select v_main_a_1215 main_y) 995))))) [2019-05-15 10:33:39,370 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:33:39,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:39,430 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:39,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:39,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,473 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:39,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:39,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1216]. (let ((.cse0 (select v_main_a_1216 main_y))) (let ((.cse2 (select v_main_a_1216 main_x)) (.cse1 (= (store v_main_a_1216 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 995) .cse1 (= .cse2 6)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:33:39,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:39,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:39,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:39,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:39,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,609 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:39,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:39,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,620 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1217]. (let ((.cse0 (select v_main_a_1217 main_x))) (let ((.cse1 (= (store v_main_a_1217 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 6) .cse1 (= (select v_main_a_1217 main_y) 994)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:39,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:33:39,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:39,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:39,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:39,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:39,691 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,716 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:39,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:39,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1218]. (let ((.cse2 (select v_main_a_1218 main_y))) (let ((.cse0 (select v_main_a_1218 main_x)) (.cse1 (= (store v_main_a_1218 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 994 .cse2) (= 7 .cse0) .cse1)))) [2019-05-15 10:33:39,726 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:33:39,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:39,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:39,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:39,798 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,822 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:39,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:39,823 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,834 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,835 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1219]. (let ((.cse0 (select v_main_a_1219 main_x))) (let ((.cse1 (= (store v_main_a_1219 main_x (+ .cse0 1)) main_a))) (or (and (= 7 .cse0) .cse1 (= 993 (select v_main_a_1219 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:33:39,835 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:33:39,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:39,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:39,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:39,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,904 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:39,906 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,930 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:39,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:39,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:39,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1220]. (let ((.cse2 (select v_main_a_1220 main_y))) (let ((.cse0 (select v_main_a_1220 main_x)) (.cse1 (= main_a (store v_main_a_1220 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 8 .cse0) (= 993 .cse2) .cse1)))) [2019-05-15 10:33:39,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:33:39,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:40,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:40,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,037 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:40,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:40,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:40,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1221]. (let ((.cse1 (select v_main_a_1221 main_x))) (let ((.cse0 (= (store v_main_a_1221 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1221 main_y) 992) .cse0 (= .cse1 8)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:33:40,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:33:40,099 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:40,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:40,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:40,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,146 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:40,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:40,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:40,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,157 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1222]. (let ((.cse2 (select v_main_a_1222 main_y))) (let ((.cse0 (= (store v_main_a_1222 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1222 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 992 .cse2) .cse0 (= .cse1 9))))) [2019-05-15 10:33:40,157 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:33:40,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:40,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:40,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,269 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:40,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:40,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:40,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1223]. (let ((.cse0 (select v_main_a_1223 main_x))) (let ((.cse1 (= (store v_main_a_1223 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1223 main_y) 991) (= .cse0 9) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:33:40,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:33:40,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,350 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:40,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:40,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,382 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:40,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:40,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:40,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1224]. (let ((.cse2 (select v_main_a_1224 main_y))) (let ((.cse1 (= (store v_main_a_1224 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1224 main_x))) (or (and (= 10 .cse0) .cse1 (= 991 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:33:40,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:40,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:40,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:40,496 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,521 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:40,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:40,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:40,530 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1225]. (let ((.cse1 (select v_main_a_1225 main_x))) (let ((.cse0 (= (store v_main_a_1225 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1225 main_y) 990) .cse0 (= .cse1 10))))) [2019-05-15 10:33:40,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:33:40,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:40,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:40,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:40,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,634 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:40,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:40,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:40,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1226]. (let ((.cse2 (select v_main_a_1226 main_y))) (let ((.cse1 (= (store v_main_a_1226 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1226 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 990) .cse1 (= .cse0 11))))) [2019-05-15 10:33:40,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:33:40,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:40,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:40,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,753 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:40,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:40,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:40,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1227]. (let ((.cse1 (select v_main_a_1227 main_x))) (let ((.cse0 (= main_a (store v_main_a_1227 main_x (+ .cse1 1))))) (or (and .cse0 (= 11 .cse1) (= 989 (select v_main_a_1227 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:33:40,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:33:40,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,844 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:40,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:40,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,879 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:40,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:40,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:40,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1228]. (let ((.cse1 (select v_main_a_1228 main_y))) (let ((.cse0 (select v_main_a_1228 main_x)) (.cse2 (= (store v_main_a_1228 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 12) (= 989 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:33:40,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:40,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:40,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:40,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:41,014 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,050 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:41,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:41,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:41,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1229]. (let ((.cse0 (select v_main_a_1229 main_x))) (let ((.cse1 (= (store v_main_a_1229 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 12) (= (select v_main_a_1229 main_y) 988) .cse1)))) [2019-05-15 10:33:41,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:33:41,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:41,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:41,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:41,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,186 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:41,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:41,187 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:41,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1230]. (let ((.cse0 (select v_main_a_1230 main_y))) (let ((.cse2 (select v_main_a_1230 main_x)) (.cse1 (= (store v_main_a_1230 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 988) .cse1 (= .cse2 13)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:33:41,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:41,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:41,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:41,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:41,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,355 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:41,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:41,355 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:41,367 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,367 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1231]. (let ((.cse1 (select v_main_a_1231 main_x))) (let ((.cse0 (= main_a (store v_main_a_1231 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1231 main_y) 987) (= .cse1 13)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:33:41,367 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:33:41,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:41,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:41,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:41,456 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,493 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:41,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:41,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:41,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1232]. (let ((.cse2 (select v_main_a_1232 main_y))) (let ((.cse0 (= (store v_main_a_1232 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1232 main_x))) (or (and .cse0 (= 14 .cse1) (= 987 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:33:41,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:33:41,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:41,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:41,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,594 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:41,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,621 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:41,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:41,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:41,634 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1233]. (let ((.cse1 (select v_main_a_1233 main_x))) (let ((.cse0 (= (store v_main_a_1233 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1233 main_y) 986) .cse0 (= .cse1 14))))) [2019-05-15 10:33:41,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:33:41,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:41,718 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:41,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:41,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,753 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:41,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:41,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:41,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1234]. (let ((.cse2 (select v_main_a_1234 main_y))) (let ((.cse1 (= (store v_main_a_1234 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1234 main_x))) (or (and (= 15 .cse0) .cse1 (= 986 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:33:41,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:41,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:41,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:41,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:41,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,932 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:41,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:41,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:41,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1235]. (let ((.cse1 (select v_main_a_1235 main_x))) (let ((.cse0 (= (store v_main_a_1235 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 15) .cse0 (= (select v_main_a_1235 main_y) 985))))) [2019-05-15 10:33:41,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:33:42,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:42,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:42,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:42,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,081 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:42,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:42,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:42,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1236]. (let ((.cse0 (select v_main_a_1236 main_y))) (let ((.cse2 (select v_main_a_1236 main_x)) (.cse1 (= (store v_main_a_1236 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 985 .cse0) .cse1 (= 16 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:33:42,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:42,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:42,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:42,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:42,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,236 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:42,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:42,236 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:42,248 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,248 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1237]. (let ((.cse0 (select v_main_a_1237 main_x))) (let ((.cse1 (= (store v_main_a_1237 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1237 main_y) 984) (= .cse0 16) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:33:42,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:33:42,335 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:42,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:42,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:42,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:42,364 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,393 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:42,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:42,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:42,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1238]. (let ((.cse2 (select v_main_a_1238 main_y))) (let ((.cse1 (= main_a (store v_main_a_1238 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1238 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 984) (= .cse0 17))))) [2019-05-15 10:33:42,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:33:42,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:42,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:42,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:42,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,538 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:42,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:42,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:42,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1239]. (let ((.cse0 (select v_main_a_1239 main_x))) (let ((.cse1 (= (store v_main_a_1239 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1239 main_y) 983) (= .cse0 17) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:33:42,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:33:42,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:42,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:42,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:42,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,685 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:42,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:42,686 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:42,756 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1240]. (let ((.cse1 (select v_main_a_1240 main_y))) (let ((.cse0 (select v_main_a_1240 main_x)) (.cse2 (= (store v_main_a_1240 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 18) (= 983 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:33:42,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:42,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:42,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:42,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:42,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,886 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:42,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:42,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:42,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,896 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1241]. (let ((.cse1 (select v_main_a_1241 main_x))) (let ((.cse0 (= (store v_main_a_1241 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 18) (= 982 (select v_main_a_1241 main_y)) .cse0)))) [2019-05-15 10:33:42,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:33:42,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:42,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:42,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:43,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,025 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:43,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:43,026 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:43,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1242]. (let ((.cse0 (select v_main_a_1242 main_y))) (let ((.cse1 (= main_a (store v_main_a_1242 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_1242 main_x))) (or (and (= .cse0 982) .cse1 (= .cse2 19)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:33:43,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:33:43,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:43,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:43,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:43,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,164 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:43,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:43,165 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:43,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1243]. (let ((.cse1 (select v_main_a_1243 main_x))) (let ((.cse0 (= (store v_main_a_1243 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 19) (= (select v_main_a_1243 main_y) 981) .cse0)))) [2019-05-15 10:33:43,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:33:43,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:43,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:43,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:43,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,323 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:43,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:43,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:43,386 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1244]. (let ((.cse2 (select v_main_a_1244 main_y))) (let ((.cse1 (= (store v_main_a_1244 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1244 main_x))) (or (and (= .cse0 20) .cse1 (= .cse2 981)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:33:43,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:43,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:43,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:43,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:43,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,515 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:43,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:43,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:43,527 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1245]. (let ((.cse1 (select v_main_a_1245 main_x))) (let ((.cse0 (= (store v_main_a_1245 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 20) (= (select v_main_a_1245 main_y) 980))))) [2019-05-15 10:33:43,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:33:43,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:43,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:43,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:43,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:43,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,662 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:43,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:43,663 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:43,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1246]. (let ((.cse2 (select v_main_a_1246 main_y))) (let ((.cse0 (select v_main_a_1246 main_x)) (.cse1 (= (store v_main_a_1246 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 21) .cse1 (= .cse2 980))))) [2019-05-15 10:33:43,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:43,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:43,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:43,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:43,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,869 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:43,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:43,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:43,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1247]. (let ((.cse1 (select v_main_a_1247 main_x))) (let ((.cse0 (= (store v_main_a_1247 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 21) .cse0 (= (select v_main_a_1247 main_y) 979))))) [2019-05-15 10:33:43,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:33:43,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:43,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:43,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:44,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,030 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:44,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:44,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:44,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:44,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1248]. (let ((.cse0 (select v_main_a_1248 main_y))) (let ((.cse1 (select v_main_a_1248 main_x)) (.cse2 (= (store v_main_a_1248 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 979) (= 22 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:33:44,042 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:33:44,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:44,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:44,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:44,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:44,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,201 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:44,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:44,202 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:44,214 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:44,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1249]. (let ((.cse1 (select v_main_a_1249 main_x))) (let ((.cse0 (= (store v_main_a_1249 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1249 main_y) 978) (= .cse1 22) .cse0)))) [2019-05-15 10:33:44,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:33:44,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:44,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:44,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:44,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:44,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,429 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:44,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:44,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:44,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:44,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1250]. (let ((.cse0 (select v_main_a_1250 main_y))) (let ((.cse2 (select v_main_a_1250 main_x)) (.cse1 (= (store v_main_a_1250 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 978) .cse1 (= .cse2 23)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:33:44,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:44,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:44,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:44,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:44,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:44,598 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,622 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:44,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:44,623 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:44,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:44,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1251]. (let ((.cse1 (select v_main_a_1251 main_x))) (let ((.cse0 (= (store v_main_a_1251 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1251 main_y) 977) .cse0 (= .cse1 23)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:33:44,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:33:44,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:44,730 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:44,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:44,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:44,738 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,762 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:44,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:44,763 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:44,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:44,790 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1252]. (let ((.cse0 (select v_main_a_1252 main_y))) (let ((.cse2 (select v_main_a_1252 main_x)) (.cse1 (= (store v_main_a_1252 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 977 .cse0) .cse1 (= .cse2 24)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:33:44,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:44,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:44,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:44,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:44,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:44,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:44,932 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:44,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:44,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:44,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:44,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1253]. (let ((.cse0 (select v_main_a_1253 main_x))) (let ((.cse1 (= main_a (store v_main_a_1253 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= 976 (select v_main_a_1253 main_y)) (= .cse0 24))))) [2019-05-15 10:33:44,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:33:45,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:45,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:45,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:45,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:45,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:45,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,072 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:45,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:45,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:45,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:45,136 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1254]. (let ((.cse2 (select v_main_a_1254 main_y))) (let ((.cse0 (select v_main_a_1254 main_x)) (.cse1 (= (store v_main_a_1254 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 976) (= .cse0 25) .cse1)))) [2019-05-15 10:33:45,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:45,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:45,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:45,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:45,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:45,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,268 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:45,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:45,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:45,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:45,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1255]. (let ((.cse1 (select v_main_a_1255 main_x))) (let ((.cse0 (= (store v_main_a_1255 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 25 .cse1) (= 975 (select v_main_a_1255 main_y)))))) [2019-05-15 10:33:45,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:33:45,368 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:45,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:45,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:45,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:45,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:45,392 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,427 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:45,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:45,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:45,493 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:45,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1256]. (let ((.cse2 (select v_main_a_1256 main_y))) (let ((.cse0 (= (store v_main_a_1256 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1256 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 975) .cse0 (= .cse1 26))))) [2019-05-15 10:33:45,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:45,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:45,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:45,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:45,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:45,608 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,633 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:45,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:45,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:45,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:45,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1257]. (let ((.cse1 (select v_main_a_1257 main_x))) (let ((.cse0 (= (store v_main_a_1257 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1257 main_y) 974) .cse0 (= .cse1 26)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:33:45,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:33:45,732 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:45,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:45,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:45,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:45,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:45,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,780 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:45,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:45,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:45,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:45,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1258]. (let ((.cse2 (select v_main_a_1258 main_y))) (let ((.cse0 (= (store v_main_a_1258 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1258 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 974) .cse0 (= .cse1 27))))) [2019-05-15 10:33:45,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:45,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:45,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:45,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:45,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:45,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:45,990 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:45,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:45,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:46,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:46,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1259]. (let ((.cse0 (select v_main_a_1259 main_x))) (let ((.cse1 (= (store v_main_a_1259 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 27 .cse0) (= (select v_main_a_1259 main_y) 973) .cse1)))) [2019-05-15 10:33:46,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:33:46,092 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:46,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:46,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:46,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:46,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:46,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,140 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:46,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:46,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:46,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:46,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1260]. (let ((.cse2 (select v_main_a_1260 main_y))) (let ((.cse1 (select v_main_a_1260 main_x)) (.cse0 (= main_a (store v_main_a_1260 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 28) .cse0 (= .cse2 973))))) [2019-05-15 10:33:46,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:46,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:46,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:46,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:46,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:46,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,336 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:46,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:46,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:46,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:46,348 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1261]. (let ((.cse1 (select v_main_a_1261 main_x))) (let ((.cse0 (= (store v_main_a_1261 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1261 main_y) 972) .cse0 (= .cse1 28)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:33:46,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:33:46,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:46,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:46,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:46,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:46,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,490 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:46,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:46,491 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:46,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:46,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1262]. (let ((.cse0 (select v_main_a_1262 main_y))) (let ((.cse2 (= (store v_main_a_1262 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1262 main_x))) (or (and (= .cse0 972) (= 29 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:33:46,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:46,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:46,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:46,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:46,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:46,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,721 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:46,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:46,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:46,733 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:46,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1263]. (let ((.cse1 (select v_main_a_1263 main_x))) (let ((.cse0 (= (store v_main_a_1263 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_1263 main_y) 971) .cse0 (= 29 .cse1))))) [2019-05-15 10:33:46,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:33:46,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:46,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:46,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:46,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:46,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:46,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:46,887 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:46,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:46,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:46,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:46,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1264]. (let ((.cse2 (select v_main_a_1264 main_y))) (let ((.cse0 (select v_main_a_1264 main_x)) (.cse1 (= (store v_main_a_1264 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 971) (= .cse0 30) .cse1)))) [2019-05-15 10:33:46,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:47,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:47,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:47,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:47,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:47,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,080 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:47,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:47,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:47,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:47,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1265]. (let ((.cse1 (select v_main_a_1265 main_x))) (let ((.cse0 (= (store v_main_a_1265 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 30) (= (select v_main_a_1265 main_y) 970)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:33:47,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:33:47,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:47,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:47,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:47,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:47,215 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,251 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:47,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:47,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:47,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:47,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1266]. (let ((.cse2 (select v_main_a_1266 main_y))) (let ((.cse1 (= (store v_main_a_1266 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1266 main_x))) (or (and (= .cse0 31) .cse1 (= 970 .cse2)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:33:47,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:47,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:47,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:47,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:47,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:47,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,472 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:47,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:47,472 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:47,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:47,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1267]. (let ((.cse1 (select v_main_a_1267 main_x))) (let ((.cse0 (= (store v_main_a_1267 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1267 main_y) 969) .cse0 (= 31 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:33:47,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:33:47,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:47,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:47,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:47,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:47,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:47,608 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,632 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:47,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:47,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:47,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:47,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1268]. (let ((.cse2 (select v_main_a_1268 main_y))) (let ((.cse1 (= (store v_main_a_1268 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1268 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 969) .cse1 (= .cse0 32))))) [2019-05-15 10:33:47,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:47,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:47,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:47,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:47,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:47,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,861 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:47,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:47,862 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:47,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:47,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1269]. (let ((.cse1 (select v_main_a_1269 main_x))) (let ((.cse0 (= (store v_main_a_1269 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 968 (select v_main_a_1269 main_y)) (= .cse1 32)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:33:47,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:33:47,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:47,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:47,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:47,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:48,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,030 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:48,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:48,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:48,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1270]. (let ((.cse2 (select v_main_a_1270 main_y))) (let ((.cse0 (= (store v_main_a_1270 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1270 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 968 .cse2) .cse0 (= 33 .cse1))))) [2019-05-15 10:33:48,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:48,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:48,233 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:48,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:33:48,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,274 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:48,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:48,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:48,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1271]. (let ((.cse0 (select v_main_a_1271 main_x))) (let ((.cse1 (= (store v_main_a_1271 main_x (+ .cse0 1)) main_a))) (or (and (= 967 (select v_main_a_1271 main_y)) (= .cse0 33) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:33:48,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:33:48,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:33:48,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:33:48,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:33:48,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:33:48,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,454 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:33:48,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:33:48,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:33:48,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1272]. (let ((.cse2 (select v_main_a_1272 main_y))) (let ((.cse0 (= (store v_main_a_1272 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1272 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 34) (= .cse2 967))))) [2019-05-15 10:33:48,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:33:48,630 INFO L273 TraceCheckUtils]: 0: Hoare triple {10453#true} a := a[x := 0]; {10458#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:33:48,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {10458#(= (select main_a main_x) 0)} a := a[y := 1000]; {10462#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:33:48,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {10462#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {10466#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:33:48,633 INFO L273 TraceCheckUtils]: 3: Hoare triple {10466#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {10470#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,634 INFO L273 TraceCheckUtils]: 4: Hoare triple {10470#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10474#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:33:48,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {10474#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {10478#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {10478#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10482#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:33:48,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {10482#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {10486#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {10486#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10490#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:33:48,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {10490#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {10494#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {10494#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10498#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:33:48,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {10498#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {10502#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {10502#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10506#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:33:48,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {10506#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {10510#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:33:48,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {10510#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {10514#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:33:48,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {10514#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {10518#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:33:48,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {10518#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {10522#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:33:48,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {10522#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {10526#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:33:48,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {10526#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {10530#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:33:48,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {10530#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {10534#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {10534#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10538#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:33:48,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {10538#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {10542#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {10542#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10546#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:33:48,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {10546#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {10550#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:33:48,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {10550#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {10554#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:33:48,659 INFO L273 TraceCheckUtils]: 25: Hoare triple {10554#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {10558#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,660 INFO L273 TraceCheckUtils]: 26: Hoare triple {10558#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10562#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:33:48,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {10562#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {10566#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {10566#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10570#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:33:48,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {10570#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {10574#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:33:48,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {10574#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {10578#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:33:48,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {10578#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {10582#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {10582#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10586#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:33:48,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {10586#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {10590#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {10590#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10594#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:33:48,670 INFO L273 TraceCheckUtils]: 35: Hoare triple {10594#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {10598#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:33:48,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {10598#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {10602#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:33:48,672 INFO L273 TraceCheckUtils]: 37: Hoare triple {10602#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {10606#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,673 INFO L273 TraceCheckUtils]: 38: Hoare triple {10606#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10610#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:33:48,674 INFO L273 TraceCheckUtils]: 39: Hoare triple {10610#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {10614#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:33:48,675 INFO L273 TraceCheckUtils]: 40: Hoare triple {10614#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {10618#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:33:48,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {10618#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {10622#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,678 INFO L273 TraceCheckUtils]: 42: Hoare triple {10622#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10626#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:33:48,679 INFO L273 TraceCheckUtils]: 43: Hoare triple {10626#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {10630#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {10630#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10634#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:33:48,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {10634#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {10638#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:33:48,682 INFO L273 TraceCheckUtils]: 46: Hoare triple {10638#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {10642#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:33:48,683 INFO L273 TraceCheckUtils]: 47: Hoare triple {10642#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {10646#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {10646#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10650#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:33:48,686 INFO L273 TraceCheckUtils]: 49: Hoare triple {10650#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {10654#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,687 INFO L273 TraceCheckUtils]: 50: Hoare triple {10654#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10658#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:33:48,688 INFO L273 TraceCheckUtils]: 51: Hoare triple {10658#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {10662#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,689 INFO L273 TraceCheckUtils]: 52: Hoare triple {10662#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10666#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:33:48,690 INFO L273 TraceCheckUtils]: 53: Hoare triple {10666#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {10670#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,691 INFO L273 TraceCheckUtils]: 54: Hoare triple {10670#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10674#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:33:48,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {10674#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {10678#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {10678#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10682#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:33:48,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {10682#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {10686#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,696 INFO L273 TraceCheckUtils]: 58: Hoare triple {10686#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10690#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:33:48,697 INFO L273 TraceCheckUtils]: 59: Hoare triple {10690#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {10694#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,698 INFO L273 TraceCheckUtils]: 60: Hoare triple {10694#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10698#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:33:48,699 INFO L273 TraceCheckUtils]: 61: Hoare triple {10698#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {10702#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,700 INFO L273 TraceCheckUtils]: 62: Hoare triple {10702#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10706#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:33:48,702 INFO L273 TraceCheckUtils]: 63: Hoare triple {10706#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {10710#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,703 INFO L273 TraceCheckUtils]: 64: Hoare triple {10710#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10714#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:33:48,704 INFO L273 TraceCheckUtils]: 65: Hoare triple {10714#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {10718#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {10718#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10722#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:33:48,706 INFO L273 TraceCheckUtils]: 67: Hoare triple {10722#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {10726#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:33:48,707 INFO L273 TraceCheckUtils]: 68: Hoare triple {10726#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {10730#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:33:48,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {10730#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {10734#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:33:48,709 INFO L273 TraceCheckUtils]: 70: Hoare triple {10734#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} assume x > y && a[x] == 1000; {10454#false} is VALID [2019-05-15 10:33:48,709 INFO L273 TraceCheckUtils]: 71: Hoare triple {10454#false} assume !(a[y] <= 0); {10454#false} is VALID [2019-05-15 10:33:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:48,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:48,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-15 10:33:48,730 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-05-15 10:33:48,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:48,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states. [2019-05-15 10:33:48,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:48,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-05-15 10:33:48,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-15 10:33:48,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-05-15 10:33:48,845 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-05-15 10:34:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:01,725 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:01,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-15 10:34:01,725 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-05-15 10:34:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-05-15 10:34:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-05-15 10:34:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-05-15 10:34:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-05-15 10:34:01,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2019-05-15 10:34:01,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:01,823 INFO L225 Difference]: With dead ends: 75 [2019-05-15 10:34:01,823 INFO L226 Difference]: Without dead ends: 75 [2019-05-15 10:34:01,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-05-15 10:34:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-05-15 10:34:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-05-15 10:34:01,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:01,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:01,825 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:01,825 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:01,826 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:01,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:01,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:01,827 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:01,827 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:01,828 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:01,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:01,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:01,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:01,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-05-15 10:34:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-05-15 10:34:01,829 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-05-15 10:34:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:01,829 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-05-15 10:34:01,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-05-15 10:34:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-05-15 10:34:01,830 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:01,830 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-05-15 10:34:01,830 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1384264582, now seen corresponding path program 35 times [2019-05-15 10:34:01,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:01,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-15 10:34:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:01,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:01,986 INFO L375 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 6 treesize of output 5 [2019-05-15 10:34:01,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:01,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1273]. (= (store v_main_a_1273 main_x 0) main_a) [2019-05-15 10:34:01,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:34:02,017 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:34:02,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,032 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:34:02,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:34:02,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1274]. (and (= (store v_main_a_1274 main_y 1000) main_a) (= (select v_main_a_1274 main_x) 0)) [2019-05-15 10:34:02,035 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:34:02,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:02,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:02,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:02,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:02,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,105 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:02,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:02,106 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:02,126 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1275]. (let ((.cse2 (select v_main_a_1275 main_x))) (let ((.cse0 (= (select v_main_a_1275 main_y) 1000)) (.cse1 (= (store v_main_a_1275 main_x (+ .cse2 1)) main_a))) (or (and (= main_y main_x) .cse0 .cse1) (and (= .cse2 0) .cse0 .cse1)))) [2019-05-15 10:34:02,126 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:34:02,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:02,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:02,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:02,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,214 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:02,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:02,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:02,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1276]. (let ((.cse1 (select v_main_a_1276 main_y))) (let ((.cse0 (= main_a (store v_main_a_1276 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_1276 main_x))) (or (and .cse0 (= .cse1 1000) (= .cse2 1)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:34:02,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:02,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:02,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:02,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:02,325 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,359 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:02,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:02,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:02,370 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1277]. (let ((.cse0 (select v_main_a_1277 main_x))) (let ((.cse1 (= (store v_main_a_1277 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= (select v_main_a_1277 main_y) 999) (= .cse0 1))))) [2019-05-15 10:34:02,370 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:34:02,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:02,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:02,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:02,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:02,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,459 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:02,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:02,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:02,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1278]. (let ((.cse2 (select v_main_a_1278 main_y))) (let ((.cse1 (select v_main_a_1278 main_x)) (.cse0 (= (store v_main_a_1278 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 999 .cse2) (= .cse1 2) .cse0)))) [2019-05-15 10:34:02,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:02,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:02,583 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:02,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:02,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,614 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:02,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:02,615 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:02,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1279]. (let ((.cse1 (select v_main_a_1279 main_x))) (let ((.cse0 (= (store v_main_a_1279 main_x (+ .cse1 1)) main_a))) (or (and (= 998 (select v_main_a_1279 main_y)) .cse0 (= 2 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:34:02,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:34:02,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:02,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:02,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:02,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,711 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:02,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:02,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:02,754 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,755 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1280]. (let ((.cse0 (select v_main_a_1280 main_y))) (let ((.cse2 (select v_main_a_1280 main_x)) (.cse1 (= main_a (store v_main_a_1280 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 998) .cse1 (= .cse2 3)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:34:02,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:02,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:02,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:02,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,811 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:02,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,837 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:02,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:02,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:02,849 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,849 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1281]. (let ((.cse0 (select v_main_a_1281 main_x))) (let ((.cse1 (= main_a (store v_main_a_1281 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1281 main_y) 997) .cse1 (= .cse0 3))))) [2019-05-15 10:34:02,849 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:34:02,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:02,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:02,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:02,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,935 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:02,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:02,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:02,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1282]. (let ((.cse1 (select v_main_a_1282 main_y))) (let ((.cse0 (= (store v_main_a_1282 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1282 main_x))) (or (and .cse0 (= .cse1 997) (= .cse2 4)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:34:02,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:03,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:03,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,054 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,091 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1283]. (let ((.cse1 (select v_main_a_1283 main_x))) (let ((.cse0 (= (store v_main_a_1283 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 4 .cse1) (= (select v_main_a_1283 main_y) 996))))) [2019-05-15 10:34:03,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:34:03,142 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:03,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:03,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,190 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1284]. (let ((.cse2 (select v_main_a_1284 main_y))) (let ((.cse0 (select v_main_a_1284 main_x)) (.cse1 (= (store v_main_a_1284 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 5) .cse1 (= .cse2 996))))) [2019-05-15 10:34:03,230 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:03,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:03,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,292 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,316 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1285]. (let ((.cse1 (select v_main_a_1285 main_x))) (let ((.cse0 (= main_a (store v_main_a_1285 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_1285 main_y) 995) (= 5 .cse1))))) [2019-05-15 10:34:03,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:34:03,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:03,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:03,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,428 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1286]. (let ((.cse2 (select v_main_a_1286 main_y))) (let ((.cse0 (= (store v_main_a_1286 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1286 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 995 .cse2) .cse0 (= .cse1 6))))) [2019-05-15 10:34:03,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:03,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:03,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,552 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1287]. (let ((.cse1 (select v_main_a_1287 main_x))) (let ((.cse0 (= (store v_main_a_1287 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1287 main_y) 994) .cse0 (= .cse1 6)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:34:03,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:34:03,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:03,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,660 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,660 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,670 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1288]. (let ((.cse2 (select v_main_a_1288 main_y))) (let ((.cse0 (select v_main_a_1288 main_x)) (.cse1 (= (store v_main_a_1288 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 7) .cse1 (= .cse2 994)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:34:03,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:34:03,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:03,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,766 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,779 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1289]. (let ((.cse1 (select v_main_a_1289 main_x))) (let ((.cse0 (= (store v_main_a_1289 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 7 .cse1) (= 993 (select v_main_a_1289 main_y)))))) [2019-05-15 10:34:03,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:34:03,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:03,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:03,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,876 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1290]. (let ((.cse2 (select v_main_a_1290 main_y))) (let ((.cse0 (select v_main_a_1290 main_x)) (.cse1 (= (store v_main_a_1290 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 8 .cse0) .cse1 (= .cse2 993))))) [2019-05-15 10:34:03,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:34:03,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:03,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:03,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,956 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:03,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,982 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:03,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:03,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:03,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1291]. (let ((.cse1 (select v_main_a_1291 main_x))) (let ((.cse0 (= (store v_main_a_1291 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 8 .cse1) (= 992 (select v_main_a_1291 main_y)))))) [2019-05-15 10:34:03,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:34:04,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:04,061 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:04,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:04,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:04,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,095 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:04,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:04,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:04,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:04,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1292]. (let ((.cse1 (select v_main_a_1292 main_y))) (let ((.cse0 (= (store v_main_a_1292 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1292 main_x))) (or (and .cse0 (= .cse1 992) (= 9 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:34:04,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:34:04,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:04,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:04,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:04,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:04,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,217 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:04,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:04,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:04,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:04,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1293]. (let ((.cse1 (select v_main_a_1293 main_x))) (let ((.cse0 (= (store v_main_a_1293 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 991 (select v_main_a_1293 main_y)) (= 9 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:34:04,230 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:34:04,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:04,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:04,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:04,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:04,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:04,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,334 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:04,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:04,334 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:04,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:04,362 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1294]. (let ((.cse2 (select v_main_a_1294 main_y))) (let ((.cse0 (select v_main_a_1294 main_x)) (.cse1 (= (store v_main_a_1294 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 991) (= .cse0 10) .cse1)))) [2019-05-15 10:34:04,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:04,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:04,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:04,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:04,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:04,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,464 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:04,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:04,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:04,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:04,474 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1295]. (let ((.cse0 (select v_main_a_1295 main_x))) (let ((.cse1 (= (store v_main_a_1295 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1295 main_y) 990) .cse1 (= .cse0 10))))) [2019-05-15 10:34:04,474 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:34:04,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:04,546 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:04,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:04,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:04,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,580 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:04,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:04,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:04,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:04,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1296]. (let ((.cse2 (select v_main_a_1296 main_y))) (let ((.cse0 (= (store v_main_a_1296 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1296 main_x))) (or (and .cse0 (= .cse1 11) (= .cse2 990)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:34:04,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:34:04,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:04,676 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:04,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:04,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:04,684 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,709 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:04,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:04,710 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:04,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:04,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1297]. (let ((.cse1 (select v_main_a_1297 main_x))) (let ((.cse0 (= main_a (store v_main_a_1297 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1297 main_y) 989) (= .cse1 11)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:34:04,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:34:04,784 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:04,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:04,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:04,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,807 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:04,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:04,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,834 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:04,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:04,834 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:04,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:04,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1298]. (let ((.cse2 (select v_main_a_1298 main_y))) (let ((.cse0 (= main_a (store v_main_a_1298 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1298 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 989) (= .cse1 12))))) [2019-05-15 10:34:04,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:04,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:04,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:04,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:04,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:04,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:04,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,006 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:05,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:05,007 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:05,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:05,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1299]. (let ((.cse0 (select v_main_a_1299 main_x))) (let ((.cse1 (= (store v_main_a_1299 main_x (+ .cse0 1)) main_a))) (or (and (= 12 .cse0) (= 988 (select v_main_a_1299 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:34:05,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:34:05,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:05,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:05,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:05,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:05,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,142 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:05,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:05,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:05,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:05,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1300]. (let ((.cse1 (select v_main_a_1300 main_y))) (let ((.cse0 (= (store v_main_a_1300 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1300 main_x))) (or (and .cse0 (= .cse1 988) (= .cse2 13)) (and .cse0 (= main_y main_x) (= .cse2 1001))))) [2019-05-15 10:34:05,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:05,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:05,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:05,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:05,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:05,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,419 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:05,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:05,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:05,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:05,430 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1301]. (let ((.cse0 (select v_main_a_1301 main_x))) (let ((.cse1 (= (store v_main_a_1301 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 13) (= (select v_main_a_1301 main_y) 987) .cse1)))) [2019-05-15 10:34:05,430 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:34:05,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:05,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:05,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:05,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:05,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,555 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:05,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:05,556 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:05,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:05,568 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1302]. (let ((.cse2 (select v_main_a_1302 main_y))) (let ((.cse1 (select v_main_a_1302 main_x)) (.cse0 (= main_a (store v_main_a_1302 main_y (+ .cse2 (- 1)))))) (or (and .cse0 (= .cse1 14) (= .cse2 987)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:34:05,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:34:05,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:05,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:05,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,653 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:05,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:05,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,680 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:05,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:05,681 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:05,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:05,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1303]. (let ((.cse0 (select v_main_a_1303 main_x))) (let ((.cse1 (= main_a (store v_main_a_1303 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1303 main_y) 986) (= .cse0 14) .cse1)))) [2019-05-15 10:34:05,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:34:05,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:05,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:05,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:05,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:05,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,809 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:05,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:05,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:05,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:05,865 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1304]. (let ((.cse1 (select v_main_a_1304 main_y))) (let ((.cse0 (select v_main_a_1304 main_x)) (.cse2 (= main_a (store v_main_a_1304 main_y (+ .cse1 (- 1)))))) (or (and (= .cse0 15) (= .cse1 986) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:34:05,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:05,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:05,951 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:05,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:05,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:05,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:05,984 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:05,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:05,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:05,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:05,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1305]. (let ((.cse1 (select v_main_a_1305 main_x))) (let ((.cse0 (= (store v_main_a_1305 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1305 main_y) 985) (= .cse1 15)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:34:05,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:34:06,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:06,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:06,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:06,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,122 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:06,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:06,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:06,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:06,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1306]. (let ((.cse2 (select v_main_a_1306 main_y))) (let ((.cse1 (= (store v_main_a_1306 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1306 main_x))) (or (and (= 16 .cse0) .cse1 (= .cse2 985)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:34:06,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:06,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:06,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:06,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:06,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,276 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:06,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:06,276 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:06,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:06,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1307]. (let ((.cse0 (select v_main_a_1307 main_x))) (let ((.cse1 (= (store v_main_a_1307 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 984 (select v_main_a_1307 main_y)) .cse1 (= 16 .cse0))))) [2019-05-15 10:34:06,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:34:06,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:06,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:06,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:06,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,408 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:06,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:06,408 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:06,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:06,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1308]. (let ((.cse2 (select v_main_a_1308 main_y))) (let ((.cse0 (= main_a (store v_main_a_1308 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1308 main_x))) (or (and .cse0 (= .cse1 17) (= .cse2 984)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:34:06,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:34:06,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:06,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:06,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:06,514 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,538 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:06,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:06,539 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:06,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:06,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1309]. (let ((.cse0 (select v_main_a_1309 main_x))) (let ((.cse1 (= (store v_main_a_1309 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1309 main_y) 983) (= .cse0 17) .cse1)))) [2019-05-15 10:34:06,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:34:06,626 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:06,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:06,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:06,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:06,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,686 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:06,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:06,687 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:06,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:06,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1310]. (let ((.cse2 (select v_main_a_1310 main_y))) (let ((.cse0 (select v_main_a_1310 main_x)) (.cse1 (= (store v_main_a_1310 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 18) (= .cse2 983) .cse1)))) [2019-05-15 10:34:06,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:06,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:06,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:06,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:06,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,876 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:06,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:06,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:06,889 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:06,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1311]. (let ((.cse1 (select v_main_a_1311 main_x))) (let ((.cse0 (= (store v_main_a_1311 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1311 main_y) 982) (= .cse1 18)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:34:06,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:34:06,969 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:06,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:06,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:06,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:06,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,021 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:07,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:07,022 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:07,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1312]. (let ((.cse2 (select v_main_a_1312 main_y))) (let ((.cse1 (select v_main_a_1312 main_x)) (.cse0 (= (store v_main_a_1312 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= .cse2 982) (= 19 .cse1) .cse0)))) [2019-05-15 10:34:07,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:34:07,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:07,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:07,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:07,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,175 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:07,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:07,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:07,189 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1313]. (let ((.cse1 (select v_main_a_1313 main_x))) (let ((.cse0 (= (store v_main_a_1313 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 19 .cse1) (= (select v_main_a_1313 main_y) 981)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:34:07,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:34:07,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:07,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:07,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:07,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:07,299 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,336 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:07,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:07,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:07,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1314]. (let ((.cse2 (select v_main_a_1314 main_y))) (let ((.cse0 (= (store v_main_a_1314 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1314 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 20) (= .cse2 981))))) [2019-05-15 10:34:07,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:07,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:07,515 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:07,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:07,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,550 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:07,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:07,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:07,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1315]. (let ((.cse1 (select v_main_a_1315 main_x))) (let ((.cse0 (= (store v_main_a_1315 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 20) (= 980 (select v_main_a_1315 main_y))) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:34:07,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:34:07,641 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:07,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:07,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:07,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,665 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:07,668 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,694 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:07,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:07,695 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:07,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,718 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1316]. (let ((.cse2 (select v_main_a_1316 main_y))) (let ((.cse0 (= main_a (store v_main_a_1316 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1316 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 980 .cse2) (= 21 .cse1))))) [2019-05-15 10:34:07,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:07,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:07,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:07,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:07,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,887 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:07,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:07,888 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:07,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1317]. (let ((.cse0 (select v_main_a_1317 main_x))) (let ((.cse1 (= (store v_main_a_1317 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1317 main_y) 979) (= .cse0 21) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:07,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:34:07,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:07,995 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:07,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:08,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,027 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:08,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:08,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:08,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1318]. (let ((.cse0 (select v_main_a_1318 main_y))) (let ((.cse1 (= (store v_main_a_1318 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1318 main_x))) (or (and (= .cse0 979) .cse1 (= .cse2 22)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:34:08,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:34:08,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:08,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:08,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:08,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,197 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:08,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:08,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:08,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1319]. (let ((.cse0 (select v_main_a_1319 main_x))) (let ((.cse1 (= (store v_main_a_1319 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1319 main_y) 978) (= .cse0 22) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:08,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:34:08,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:08,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:08,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:08,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:08,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,350 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:08,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:08,350 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:08,434 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,434 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1320]. (let ((.cse2 (select v_main_a_1320 main_y))) (let ((.cse1 (select v_main_a_1320 main_x)) (.cse0 (= (store v_main_a_1320 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 23) .cse0 (= .cse2 978))))) [2019-05-15 10:34:08,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:08,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:08,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:08,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:08,537 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,563 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:08,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:08,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:08,575 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1321]. (let ((.cse1 (select v_main_a_1321 main_x))) (let ((.cse0 (= main_a (store v_main_a_1321 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 23 .cse1) (= (select v_main_a_1321 main_y) 977) .cse0)))) [2019-05-15 10:34:08,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:34:08,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:08,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:08,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:08,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,713 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:08,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:08,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:08,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1322]. (let ((.cse2 (select v_main_a_1322 main_y))) (let ((.cse0 (= (store v_main_a_1322 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1322 main_x))) (or (and .cse0 (= 24 .cse1) (= .cse2 977)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:34:08,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:08,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:08,882 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:08,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:08,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,923 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:08,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:08,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:08,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1323]. (let ((.cse0 (select v_main_a_1323 main_x))) (let ((.cse1 (= (store v_main_a_1323 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1323 main_y) 976) (= 24 .cse0) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:34:08,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:34:09,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:09,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:09,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:09,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,075 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:09,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:09,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:09,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1324]. (let ((.cse0 (select v_main_a_1324 main_y))) (let ((.cse1 (select v_main_a_1324 main_x)) (.cse2 (= main_a (store v_main_a_1324 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 976) (= .cse1 25) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:34:09,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:09,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:09,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:09,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:09,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,286 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:09,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:09,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:09,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1325]. (let ((.cse0 (select v_main_a_1325 main_x))) (let ((.cse1 (= (store v_main_a_1325 main_x (+ .cse0 1)) main_a))) (or (and (= 25 .cse0) (= 975 (select v_main_a_1325 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:34:09,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:34:09,384 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:09,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:09,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:09,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,406 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:09,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,446 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:09,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:09,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:09,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1326]. (let ((.cse2 (select v_main_a_1326 main_y))) (let ((.cse0 (select v_main_a_1326 main_x)) (.cse1 (= main_a (store v_main_a_1326 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 975 .cse2) (= 26 .cse0) .cse1)))) [2019-05-15 10:34:09,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:09,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:09,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:09,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:09,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,623 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:09,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:09,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:09,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1327]. (let ((.cse1 (select v_main_a_1327 main_x))) (let ((.cse0 (= (store v_main_a_1327 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1327 main_y) 974) .cse0 (= .cse1 26))))) [2019-05-15 10:34:09,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:34:09,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:09,745 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:09,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:09,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,779 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:09,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:09,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:09,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1328]. (let ((.cse1 (select v_main_a_1328 main_y))) (let ((.cse2 (select v_main_a_1328 main_x)) (.cse0 (= (store v_main_a_1328 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= 974 .cse1) (= 27 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse0)))) [2019-05-15 10:34:09,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:09,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:09,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:09,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:09,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,950 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:09,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:09,950 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:09,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1329]. (let ((.cse0 (select v_main_a_1329 main_x))) (let ((.cse1 (= (store v_main_a_1329 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1329 main_y) 973) (= .cse0 27) .cse1)))) [2019-05-15 10:34:09,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:34:10,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:10,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:10,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:10,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:10,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,103 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:10,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:10,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:10,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1330]. (let ((.cse2 (select v_main_a_1330 main_y))) (let ((.cse0 (= (store v_main_a_1330 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1330 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 973 .cse2) (= 28 .cse1))))) [2019-05-15 10:34:10,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:10,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:10,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:10,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:10,284 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,309 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:10,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:10,310 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:10,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1331]. (let ((.cse1 (select v_main_a_1331 main_x))) (let ((.cse0 (= (store v_main_a_1331 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1331 main_y) 972) (= .cse1 28))))) [2019-05-15 10:34:10,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:34:10,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:10,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:10,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:10,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,468 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:10,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:10,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:10,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1332]. (let ((.cse1 (select v_main_a_1332 main_y))) (let ((.cse0 (= (store v_main_a_1332 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1332 main_x))) (or (and .cse0 (= .cse1 972) (= .cse2 29)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:34:10,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:10,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:10,634 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:10,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:10,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,665 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:10,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:10,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:10,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1333]. (let ((.cse0 (select v_main_a_1333 main_x))) (let ((.cse1 (= (store v_main_a_1333 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 29) .cse1 (= (select v_main_a_1333 main_y) 971)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:34:10,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:34:10,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:10,796 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:10,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:10,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,840 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:10,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:10,841 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:10,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1334]. (let ((.cse1 (select v_main_a_1334 main_y))) (let ((.cse0 (select v_main_a_1334 main_x)) (.cse2 (= (store v_main_a_1334 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 30) (= .cse1 971) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:34:10,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:11,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:11,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:11,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,064 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:11,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:11,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,100 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:11,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:11,100 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:11,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:11,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1335]. (let ((.cse1 (select v_main_a_1335 main_x))) (let ((.cse0 (= (store v_main_a_1335 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 30) .cse0 (= (select v_main_a_1335 main_y) 970))))) [2019-05-15 10:34:11,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:34:11,215 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:11,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:11,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:11,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:11,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:11,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,275 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:11,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:11,276 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:11,335 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:11,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1336]. (let ((.cse2 (select v_main_a_1336 main_y))) (let ((.cse1 (select v_main_a_1336 main_x)) (.cse0 (= (store v_main_a_1336 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 31) .cse0 (= .cse2 970))))) [2019-05-15 10:34:11,336 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:11,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:11,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:11,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:11,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:11,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,494 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:11,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:11,495 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:11,509 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:11,509 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1337]. (let ((.cse1 (select v_main_a_1337 main_x))) (let ((.cse0 (= (store v_main_a_1337 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 31) .cse0 (= (select v_main_a_1337 main_y) 969))))) [2019-05-15 10:34:11,509 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:34:11,611 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:11,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:11,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:11,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:11,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:11,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,660 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:11,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:11,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:11,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:11,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1338]. (let ((.cse2 (select v_main_a_1338 main_y))) (let ((.cse1 (= (store v_main_a_1338 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1338 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 32) (= .cse2 969))))) [2019-05-15 10:34:11,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:11,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:11,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:11,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:11,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:11,855 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:11,890 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:11,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:11,891 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:11,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:11,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1339]. (let ((.cse1 (select v_main_a_1339 main_x))) (let ((.cse0 (= (store v_main_a_1339 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 968 (select v_main_a_1339 main_y)) .cse0 (= 32 .cse1))))) [2019-05-15 10:34:11,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:34:12,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:12,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:12,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:12,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,058 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:12,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:12,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:12,092 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1340]. (let ((.cse0 (select v_main_a_1340 main_y))) (let ((.cse1 (select v_main_a_1340 main_x)) (.cse2 (= (store v_main_a_1340 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 968 .cse0) (= 33 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:34:12,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:12,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:12,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:12,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:12,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,258 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:12,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:12,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:12,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1341]. (let ((.cse1 (select v_main_a_1341 main_x))) (let ((.cse0 (= (store v_main_a_1341 main_x (+ .cse1 1)) main_a))) (or (and (= 967 (select v_main_a_1341 main_y)) .cse0 (= 33 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:34:12,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:34:12,370 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:12,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:12,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:12,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:12,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,430 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:12,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:12,431 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:12,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1342]. (let ((.cse2 (select v_main_a_1342 main_y))) (let ((.cse0 (= (store v_main_a_1342 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1342 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 967) (= .cse1 34))))) [2019-05-15 10:34:12,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:12,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:12,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:12,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:12,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,664 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:12,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:12,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:12,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,680 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1343]. (let ((.cse1 (select v_main_a_1343 main_x))) (let ((.cse0 (= main_a (store v_main_a_1343 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1343 main_y) 966) (= .cse1 34)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:34:12,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:34:12,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:12,850 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:12,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:12,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,885 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:12,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:12,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:12,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1344]. (let ((.cse2 (select v_main_a_1344 main_y))) (let ((.cse1 (= (store v_main_a_1344 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1344 main_x))) (or (and (= .cse0 35) .cse1 (= .cse2 966)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:34:12,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:34:13,002 INFO L273 TraceCheckUtils]: 0: Hoare triple {11040#true} a := a[x := 0]; {11045#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:34:13,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {11045#(= (select main_a main_x) 0)} a := a[y := 1000]; {11049#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:34:13,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {11049#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {11053#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:34:13,005 INFO L273 TraceCheckUtils]: 3: Hoare triple {11053#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {11057#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,007 INFO L273 TraceCheckUtils]: 4: Hoare triple {11057#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11061#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:34:13,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {11061#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {11065#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {11065#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11069#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:34:13,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {11069#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {11073#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,011 INFO L273 TraceCheckUtils]: 8: Hoare triple {11073#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11077#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:34:13,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {11077#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {11081#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {11081#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11085#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:34:13,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {11085#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {11089#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11093#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:34:13,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {11093#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {11097#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:34:13,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {11097#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {11101#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:34:13,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {11101#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {11105#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:34:13,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {11105#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {11109#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:34:13,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {11109#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {11113#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:34:13,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {11113#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {11117#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:34:13,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {11117#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {11121#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {11121#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11125#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:34:13,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {11125#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {11129#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {11129#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11133#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:34:13,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {11133#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {11137#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:34:13,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {11137#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {11141#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:34:13,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {11141#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {11145#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,047 INFO L273 TraceCheckUtils]: 26: Hoare triple {11145#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11149#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:34:13,048 INFO L273 TraceCheckUtils]: 27: Hoare triple {11149#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {11153#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {11153#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11157#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:34:13,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {11157#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {11161#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:34:13,051 INFO L273 TraceCheckUtils]: 30: Hoare triple {11161#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {11165#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:34:13,053 INFO L273 TraceCheckUtils]: 31: Hoare triple {11165#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {11169#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,054 INFO L273 TraceCheckUtils]: 32: Hoare triple {11169#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11173#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:34:13,055 INFO L273 TraceCheckUtils]: 33: Hoare triple {11173#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {11177#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,056 INFO L273 TraceCheckUtils]: 34: Hoare triple {11177#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11181#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:34:13,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {11181#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {11185#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:34:13,058 INFO L273 TraceCheckUtils]: 36: Hoare triple {11185#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {11189#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:34:13,059 INFO L273 TraceCheckUtils]: 37: Hoare triple {11189#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {11193#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,060 INFO L273 TraceCheckUtils]: 38: Hoare triple {11193#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11197#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:34:13,062 INFO L273 TraceCheckUtils]: 39: Hoare triple {11197#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {11201#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:34:13,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {11201#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {11205#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:34:13,064 INFO L273 TraceCheckUtils]: 41: Hoare triple {11205#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {11209#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,065 INFO L273 TraceCheckUtils]: 42: Hoare triple {11209#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11213#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:34:13,066 INFO L273 TraceCheckUtils]: 43: Hoare triple {11213#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {11217#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,067 INFO L273 TraceCheckUtils]: 44: Hoare triple {11217#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11221#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:34:13,068 INFO L273 TraceCheckUtils]: 45: Hoare triple {11221#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {11225#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:34:13,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {11225#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {11229#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:34:13,071 INFO L273 TraceCheckUtils]: 47: Hoare triple {11229#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {11233#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {11233#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11237#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:34:13,073 INFO L273 TraceCheckUtils]: 49: Hoare triple {11237#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {11241#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,074 INFO L273 TraceCheckUtils]: 50: Hoare triple {11241#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11245#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:34:13,075 INFO L273 TraceCheckUtils]: 51: Hoare triple {11245#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {11249#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {11249#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11253#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:34:13,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {11253#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {11257#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,079 INFO L273 TraceCheckUtils]: 54: Hoare triple {11257#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11261#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:34:13,080 INFO L273 TraceCheckUtils]: 55: Hoare triple {11261#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {11265#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,081 INFO L273 TraceCheckUtils]: 56: Hoare triple {11265#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11269#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:34:13,082 INFO L273 TraceCheckUtils]: 57: Hoare triple {11269#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {11273#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,083 INFO L273 TraceCheckUtils]: 58: Hoare triple {11273#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11277#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:34:13,084 INFO L273 TraceCheckUtils]: 59: Hoare triple {11277#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {11281#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,086 INFO L273 TraceCheckUtils]: 60: Hoare triple {11281#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11285#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:34:13,087 INFO L273 TraceCheckUtils]: 61: Hoare triple {11285#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {11289#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,088 INFO L273 TraceCheckUtils]: 62: Hoare triple {11289#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11293#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:34:13,089 INFO L273 TraceCheckUtils]: 63: Hoare triple {11293#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {11297#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,090 INFO L273 TraceCheckUtils]: 64: Hoare triple {11297#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11301#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:34:13,091 INFO L273 TraceCheckUtils]: 65: Hoare triple {11301#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {11305#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,093 INFO L273 TraceCheckUtils]: 66: Hoare triple {11305#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11309#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:34:13,094 INFO L273 TraceCheckUtils]: 67: Hoare triple {11309#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {11313#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:13,095 INFO L273 TraceCheckUtils]: 68: Hoare triple {11313#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11317#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:34:13,096 INFO L273 TraceCheckUtils]: 69: Hoare triple {11317#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {11321#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:34:13,097 INFO L273 TraceCheckUtils]: 70: Hoare triple {11321#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {11325#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:34:13,098 INFO L273 TraceCheckUtils]: 71: Hoare triple {11325#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {11329#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:34:13,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {11329#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} assume x > y && a[x] == 1000; {11041#false} is VALID [2019-05-15 10:34:13,099 INFO L273 TraceCheckUtils]: 73: Hoare triple {11041#false} assume !(a[y] <= 0); {11041#false} is VALID [2019-05-15 10:34:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:13,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:13,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-15 10:34:13,120 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-05-15 10:34:13,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:13,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states. [2019-05-15 10:34:13,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:13,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-05-15 10:34:13,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-15 10:34:13,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-05-15 10:34:13,238 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-05-15 10:34:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:26,850 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:34:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-15 10:34:26,850 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-05-15 10:34:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-05-15 10:34:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-05-15 10:34:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-05-15 10:34:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-05-15 10:34:26,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2019-05-15 10:34:26,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:26,958 INFO L225 Difference]: With dead ends: 77 [2019-05-15 10:34:26,958 INFO L226 Difference]: Without dead ends: 77 [2019-05-15 10:34:26,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-05-15 10:34:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-05-15 10:34:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-05-15 10:34:26,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:26,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2019-05-15 10:34:26,960 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2019-05-15 10:34:26,961 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2019-05-15 10:34:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:26,962 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:34:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:34:26,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:26,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:26,962 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2019-05-15 10:34:26,962 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2019-05-15 10:34:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:26,963 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:34:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:34:26,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:26,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:26,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:26,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-05-15 10:34:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-05-15 10:34:26,965 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-05-15 10:34:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:26,965 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-05-15 10:34:26,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-05-15 10:34:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:34:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-05-15 10:34:26,966 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:26,966 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-05-15 10:34:26,966 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1161751897, now seen corresponding path program 36 times [2019-05-15 10:34:26,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:27,041 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-15 10:34:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:27,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:27,079 INFO L375 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 6 treesize of output 5 [2019-05-15 10:34:27,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:27,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1345]. (= (store v_main_a_1345 main_x 0) main_a) [2019-05-15 10:34:27,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:34:27,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:34:27,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,124 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:34:27,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:34:27,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1346]. (and (= (select v_main_a_1346 main_x) 0) (= (store v_main_a_1346 main_y 1000) main_a)) [2019-05-15 10:34:27,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:34:27,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:27,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:27,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:27,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:27,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,197 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:27,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:27,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:27,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1347]. (let ((.cse2 (select v_main_a_1347 main_x))) (let ((.cse0 (= (store v_main_a_1347 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_1347 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 (= .cse2 0) .cse1)))) [2019-05-15 10:34:27,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:34:27,237 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:27,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:27,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:27,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:27,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,285 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:27,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:27,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:27,323 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1348]. (let ((.cse2 (select v_main_a_1348 main_y))) (let ((.cse0 (= (store v_main_a_1348 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1348 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 1) (= .cse2 1000))))) [2019-05-15 10:34:27,324 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:27,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:27,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:27,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:27,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,413 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:27,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:27,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:27,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1349]. (let ((.cse1 (select v_main_a_1349 main_x))) (let ((.cse0 (= (store v_main_a_1349 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1349 main_y) 999) (= 1 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:34:27,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:34:27,459 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:27,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:27,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:27,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:27,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,518 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:27,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:27,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:27,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1350]. (let ((.cse2 (select v_main_a_1350 main_y))) (let ((.cse1 (= (store v_main_a_1350 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1350 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 999) .cse1 (= .cse0 2))))) [2019-05-15 10:34:27,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:27,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:27,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:27,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,614 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:27,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,640 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:27,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:27,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:27,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1351]. (let ((.cse1 (select v_main_a_1351 main_x))) (let ((.cse0 (= (store v_main_a_1351 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= .cse1 2) (= (select v_main_a_1351 main_y) 998))))) [2019-05-15 10:34:27,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:34:27,689 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:27,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:27,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:27,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:27,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,736 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:27,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:27,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:27,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1352]. (let ((.cse2 (select v_main_a_1352 main_y))) (let ((.cse1 (= (store v_main_a_1352 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1352 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 3) (= .cse2 998))))) [2019-05-15 10:34:27,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:27,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:27,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:27,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:27,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,884 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:27,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:27,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:27,893 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,893 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1353]. (let ((.cse0 (select v_main_a_1353 main_x))) (let ((.cse1 (= (store v_main_a_1353 main_x (+ .cse0 1)) main_a))) (or (and (= 997 (select v_main_a_1353 main_y)) (= 3 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:34:27,893 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:34:27,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:27,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:27,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:27,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:27,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,978 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:27,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:27,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1354]. (let ((.cse2 (select v_main_a_1354 main_y))) (let ((.cse0 (= main_a (store v_main_a_1354 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1354 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 4) (= .cse2 997))))) [2019-05-15 10:34:28,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:28,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:28,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:28,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:28,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,101 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:28,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:28,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1355]. (let ((.cse0 (select v_main_a_1355 main_x))) (let ((.cse1 (= (store v_main_a_1355 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 4) .cse1 (= 996 (select v_main_a_1355 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:28,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:34:28,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:28,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:28,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:28,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,204 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:28,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:28,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,245 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1356]. (let ((.cse1 (select v_main_a_1356 main_y))) (let ((.cse0 (select v_main_a_1356 main_x)) (.cse2 (= (store v_main_a_1356 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 5 .cse0) (= .cse1 996) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:34:28,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:28,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:28,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:28,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:28,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,339 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:28,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:28,340 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1357]. (let ((.cse1 (select v_main_a_1357 main_x))) (let ((.cse0 (= (store v_main_a_1357 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 995 (select v_main_a_1357 main_y)) (= 5 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:34:28,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:34:28,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:28,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:28,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:28,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,455 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:28,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:28,456 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1358]. (let ((.cse1 (select v_main_a_1358 main_y))) (let ((.cse2 (= (store v_main_a_1358 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1358 main_x))) (or (and (= .cse0 6) (= .cse1 995) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:34:28,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:28,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:28,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:28,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:28,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,567 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:28,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:28,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,576 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,576 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1359]. (let ((.cse1 (select v_main_a_1359 main_x))) (let ((.cse0 (= (store v_main_a_1359 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 6) (= (select v_main_a_1359 main_y) 994))))) [2019-05-15 10:34:28,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:34:28,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:28,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:28,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:28,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:28,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,671 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:28,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:28,671 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1360]. (let ((.cse2 (select v_main_a_1360 main_y))) (let ((.cse1 (select v_main_a_1360 main_x)) (.cse0 (= main_a (store v_main_a_1360 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 7) .cse0 (= .cse2 994))))) [2019-05-15 10:34:28,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:34:28,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:28,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:28,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:28,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,780 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:28,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:28,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1361]. (let ((.cse0 (select v_main_a_1361 main_x))) (let ((.cse1 (= (store v_main_a_1361 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 7 .cse0) (= (select v_main_a_1361 main_y) 993) .cse1)))) [2019-05-15 10:34:28,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:34:28,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:28,859 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:28,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:28,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,892 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:28,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:28,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:28,976 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1362]. (let ((.cse1 (select v_main_a_1362 main_y))) (let ((.cse0 (= (store v_main_a_1362 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1362 main_x))) (or (and .cse0 (= 993 .cse1) (= .cse2 8)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:34:28,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:29,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:29,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:29,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,077 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:29,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:29,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:29,091 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1363]. (let ((.cse0 (select v_main_a_1363 main_x))) (let ((.cse1 (= main_a (store v_main_a_1363 main_x (+ .cse0 1))))) (or (and (= .cse0 8) .cse1 (= (select v_main_a_1363 main_y) 992)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:29,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:34:29,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:29,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:29,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,193 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:29,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:29,193 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:29,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1364]. (let ((.cse2 (select v_main_a_1364 main_y))) (let ((.cse0 (= (store v_main_a_1364 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1364 main_x))) (or (and .cse0 (= .cse1 9) (= .cse2 992)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:34:29,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:34:29,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:29,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:29,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,315 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:29,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:29,315 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:29,323 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1365]. (let ((.cse1 (select v_main_a_1365 main_x))) (let ((.cse0 (= (store v_main_a_1365 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1365 main_y) 991) .cse0 (= .cse1 9))))) [2019-05-15 10:34:29,324 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:34:29,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:29,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:29,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:29,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,426 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:29,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:29,427 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:29,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1366]. (let ((.cse2 (select v_main_a_1366 main_y))) (let ((.cse0 (= (store v_main_a_1366 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1366 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 10) (= .cse2 991))))) [2019-05-15 10:34:29,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:29,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:29,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,538 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:29,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,565 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:29,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:29,566 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:29,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,574 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1367]. (let ((.cse1 (select v_main_a_1367 main_x))) (let ((.cse0 (= main_a (store v_main_a_1367 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= .cse1 10) (= (select v_main_a_1367 main_y) 990))))) [2019-05-15 10:34:29,574 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:34:29,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:29,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:29,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,650 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:29,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,677 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:29,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:29,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:29,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,688 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1368]. (let ((.cse2 (select v_main_a_1368 main_y))) (let ((.cse0 (= (store v_main_a_1368 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1368 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 990) .cse0 (= .cse1 11))))) [2019-05-15 10:34:29,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:34:29,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:29,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:29,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,797 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:29,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:29,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:29,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1369]. (let ((.cse1 (select v_main_a_1369 main_x))) (let ((.cse0 (= (store v_main_a_1369 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1369 main_y) 989) (= 11 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:34:29,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:34:29,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:29,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:29,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,891 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:29,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,917 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:29,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:29,918 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:29,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1370]. (let ((.cse2 (select v_main_a_1370 main_y))) (let ((.cse1 (select v_main_a_1370 main_x)) (.cse0 (= (store v_main_a_1370 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 12) (= .cse2 989) .cse0)))) [2019-05-15 10:34:29,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:29,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:29,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:29,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:30,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:30,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,047 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:30,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:30,048 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:30,059 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:30,059 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1371]. (let ((.cse0 (select v_main_a_1371 main_x))) (let ((.cse1 (= (store v_main_a_1371 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 988 (select v_main_a_1371 main_y)) (= 12 .cse0) .cse1)))) [2019-05-15 10:34:30,059 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:34:30,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:30,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:30,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:30,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:30,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:30,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,180 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:30,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:30,181 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:30,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:30,234 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1372]. (let ((.cse2 (select v_main_a_1372 main_y))) (let ((.cse0 (= (store v_main_a_1372 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1372 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 988) .cse0 (= .cse1 13))))) [2019-05-15 10:34:30,234 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:30,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:30,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:30,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:30,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:30,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,347 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:30,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:30,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:30,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:30,359 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1373]. (let ((.cse0 (select v_main_a_1373 main_x))) (let ((.cse1 (= (store v_main_a_1373 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 13) .cse1 (= (select v_main_a_1373 main_y) 987)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:34:30,359 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:34:30,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:30,440 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:30,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:30,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:30,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,485 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:30,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:30,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:30,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:30,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1374]. (let ((.cse1 (select v_main_a_1374 main_y))) (let ((.cse2 (= (store v_main_a_1374 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1374 main_x))) (or (and (= .cse0 14) (= .cse1 987) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:34:30,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:34:30,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:30,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:30,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,582 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:30,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:30,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,610 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:30,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:30,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:30,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:30,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1375]. (let ((.cse1 (select v_main_a_1375 main_x))) (let ((.cse0 (= main_a (store v_main_a_1375 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 14) .cse0 (= (select v_main_a_1375 main_y) 986))))) [2019-05-15 10:34:30,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:34:30,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:30,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:30,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:30,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:30,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:30,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,738 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:30,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:30,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:30,758 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:30,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1376]. (let ((.cse2 (select v_main_a_1376 main_y))) (let ((.cse1 (= (store v_main_a_1376 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1376 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 15 .cse0) (= 986 .cse2))))) [2019-05-15 10:34:30,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:30,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:30,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:30,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:30,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:30,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,873 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:30,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:30,874 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:30,885 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:30,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1377]. (let ((.cse0 (select v_main_a_1377 main_x))) (let ((.cse1 (= (store v_main_a_1377 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 15) (= (select v_main_a_1377 main_y) 985) .cse1)))) [2019-05-15 10:34:30,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:34:30,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:30,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:30,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:30,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:30,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:30,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,018 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:31,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:31,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:31,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:31,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1378]. (let ((.cse1 (select v_main_a_1378 main_y))) (let ((.cse2 (= (store v_main_a_1378 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1378 main_x))) (or (and (= .cse0 16) (= .cse1 985) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:34:31,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:31,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:31,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:31,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,145 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:31,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:31,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,171 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:31,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:31,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:31,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:31,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1379]. (let ((.cse1 (select v_main_a_1379 main_x))) (let ((.cse0 (= main_a (store v_main_a_1379 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1379 main_y) 984) .cse0 (= .cse1 16))))) [2019-05-15 10:34:31,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:34:31,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:31,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:31,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:31,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:31,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:31,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,305 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:31,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:31,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:31,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:31,316 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1380]. (let ((.cse2 (select v_main_a_1380 main_y))) (let ((.cse1 (select v_main_a_1380 main_x)) (.cse0 (= (store v_main_a_1380 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 984 .cse2) (= 17 .cse1) .cse0)))) [2019-05-15 10:34:31,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:34:31,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:31,405 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:31,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:31,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:31,414 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,440 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:31,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:31,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:31,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:31,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1381]. (let ((.cse0 (select v_main_a_1381 main_x))) (let ((.cse1 (= main_a (store v_main_a_1381 main_x (+ .cse0 1))))) (or (and (= .cse0 17) .cse1 (= (select v_main_a_1381 main_y) 983)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:34:31,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:34:31,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:31,550 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:31,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:31,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:31,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,597 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:31,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:31,597 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:31,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:31,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1382]. (let ((.cse1 (select v_main_a_1382 main_y))) (let ((.cse0 (select v_main_a_1382 main_x)) (.cse2 (= (store v_main_a_1382 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 18) (= .cse1 983) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:34:31,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:31,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:31,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:31,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:31,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:31,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,768 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:31,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:31,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:31,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:31,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1383]. (let ((.cse1 (select v_main_a_1383 main_x))) (let ((.cse0 (= (store v_main_a_1383 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1383 main_y) 982) .cse0 (= .cse1 18))))) [2019-05-15 10:34:31,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:34:31,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:31,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:31,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:31,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,881 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:31,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:31,883 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:31,908 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:31,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:31,908 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:31,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:31,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1384]. (let ((.cse2 (select v_main_a_1384 main_y))) (let ((.cse1 (select v_main_a_1384 main_x)) (.cse0 (= main_a (store v_main_a_1384 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 982) (= .cse1 19) .cse0)))) [2019-05-15 10:34:31,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:34:31,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:31,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:31,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,017 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:32,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:32,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,044 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:32,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:32,045 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:32,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:32,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1385]. (let ((.cse0 (select v_main_a_1385 main_x))) (let ((.cse1 (= (store v_main_a_1385 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 19) (= (select v_main_a_1385 main_y) 981))))) [2019-05-15 10:34:32,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:34:32,134 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:32,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:32,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:32,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:32,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:32,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,196 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:32,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:32,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:32,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:32,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1386]. (let ((.cse2 (select v_main_a_1386 main_y))) (let ((.cse0 (select v_main_a_1386 main_x)) (.cse1 (= (store v_main_a_1386 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 981) (= .cse0 20) .cse1)))) [2019-05-15 10:34:32,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:32,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:32,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:32,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:32,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:32,401 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,425 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:32,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:32,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:32,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:32,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1387]. (let ((.cse1 (select v_main_a_1387 main_x))) (let ((.cse0 (= (store v_main_a_1387 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 980 (select v_main_a_1387 main_y)) (= .cse1 20)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:34:32,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:34:32,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:32,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:32,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:32,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:32,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:32,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,559 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:32,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:32,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:32,651 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:32,651 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1388]. (let ((.cse2 (select v_main_a_1388 main_y))) (let ((.cse0 (= (store v_main_a_1388 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1388 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 21) (= 980 .cse2))))) [2019-05-15 10:34:32,651 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:32,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:32,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:32,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:32,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:32,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,783 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:32,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:32,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:32,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:32,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1389]. (let ((.cse0 (select v_main_a_1389 main_x))) (let ((.cse1 (= (store v_main_a_1389 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1389 main_y) 979) (= .cse0 21) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:34:32,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:34:32,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:32,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:32,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:32,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:32,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:32,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:32,932 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:32,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:32,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:32,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:32,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1390]. (let ((.cse2 (select v_main_a_1390 main_y))) (let ((.cse0 (= (store v_main_a_1390 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1390 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 22) (= .cse2 979))))) [2019-05-15 10:34:32,944 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:34:33,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:33,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:33,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:33,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:33,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,071 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:33,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:33,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:33,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:33,083 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1391]. (let ((.cse1 (select v_main_a_1391 main_x))) (let ((.cse0 (= (store v_main_a_1391 main_x (+ .cse1 1)) main_a))) (or (and (= 978 (select v_main_a_1391 main_y)) .cse0 (= 22 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:34:33,083 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:34:33,163 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:33,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:33,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:33,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,185 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:33,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:33,187 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,221 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:33,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:33,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:33,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:33,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1392]. (let ((.cse2 (select v_main_a_1392 main_y))) (let ((.cse0 (select v_main_a_1392 main_x)) (.cse1 (= (store v_main_a_1392 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 978 .cse2) (= .cse0 23) .cse1)))) [2019-05-15 10:34:33,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:33,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:33,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:33,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:33,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:33,396 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,419 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:33,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:33,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:33,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:33,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1393]. (let ((.cse0 (select v_main_a_1393 main_x))) (let ((.cse1 (= (store v_main_a_1393 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= (select v_main_a_1393 main_y) 977) (= .cse0 23))))) [2019-05-15 10:34:33,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:34:33,515 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:33,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:33,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:33,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:33,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:33,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,562 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:33,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:33,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:33,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:33,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1394]. (let ((.cse2 (select v_main_a_1394 main_y))) (let ((.cse0 (= (store v_main_a_1394 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1394 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 977) (= .cse1 24))))) [2019-05-15 10:34:33,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:33,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:33,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:33,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:33,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:33,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,785 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:33,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:33,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:33,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:33,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1395]. (let ((.cse1 (select v_main_a_1395 main_x))) (let ((.cse0 (= (store v_main_a_1395 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 24) (= (select v_main_a_1395 main_y) 976)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:34:33,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:34:33,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:33,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:33,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:33,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:33,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:33,929 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:33,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:33,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:33,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:33,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1396]. (let ((.cse0 (select v_main_a_1396 main_y))) (let ((.cse1 (= main_a (store v_main_a_1396 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_1396 main_x))) (or (and (= .cse0 976) .cse1 (= .cse2 25)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:34:33,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:34,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:34,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:34,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:34,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,122 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:34,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:34,123 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:34,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1397]. (let ((.cse0 (select v_main_a_1397 main_x))) (let ((.cse1 (= (store v_main_a_1397 main_x (+ .cse0 1)) main_a))) (or (and (= 975 (select v_main_a_1397 main_y)) (= 25 .cse0) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:34:34,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:34:34,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:34,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:34,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:34,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:34,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,269 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:34,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:34,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:34,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1398]. (let ((.cse2 (select v_main_a_1398 main_y))) (let ((.cse0 (= (store v_main_a_1398 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1398 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 975) .cse0 (= .cse1 26))))) [2019-05-15 10:34:34,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:34,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:34,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:34,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:34,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,457 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:34,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:34,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:34,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1399]. (let ((.cse0 (select v_main_a_1399 main_x))) (let ((.cse1 (= (store v_main_a_1399 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1399 main_y) 974) (= .cse0 26) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:34,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:34:34,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:34,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:34,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:34,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,608 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:34,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:34,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:34,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1400]. (let ((.cse0 (select v_main_a_1400 main_y))) (let ((.cse1 (select v_main_a_1400 main_x)) (.cse2 (= (store v_main_a_1400 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 974 .cse0) (= 27 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:34:34,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:34,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:34,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:34,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:34,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,792 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:34,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:34,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:34,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1401]. (let ((.cse0 (select v_main_a_1401 main_x))) (let ((.cse1 (= (store v_main_a_1401 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 27) (= (select v_main_a_1401 main_y) 973) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:34,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:34:34,900 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:34,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:34,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:34,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:34,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,951 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:34,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:34,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:34,977 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,978 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1402]. (let ((.cse2 (select v_main_a_1402 main_y))) (let ((.cse0 (= (store v_main_a_1402 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1402 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 28) (= .cse2 973))))) [2019-05-15 10:34:34,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:35,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:35,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:35,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:35,097 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,123 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:35,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:35,123 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:35,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1403]. (let ((.cse1 (select v_main_a_1403 main_x))) (let ((.cse0 (= (store v_main_a_1403 main_x (+ .cse1 1)) main_a))) (or (and (= 972 (select v_main_a_1403 main_y)) .cse0 (= .cse1 28)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:34:35,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:34:35,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:35,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:35,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:35,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,281 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:35,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:35,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:35,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1404]. (let ((.cse0 (select v_main_a_1404 main_y))) (let ((.cse2 (= (store v_main_a_1404 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1404 main_x))) (or (and (= 972 .cse0) (= 29 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:34:35,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:35,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:35,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:35,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:35,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,534 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:35,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:35,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:35,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1405]. (let ((.cse0 (select v_main_a_1405 main_x))) (let ((.cse1 (= main_a (store v_main_a_1405 main_x (+ .cse0 1))))) (or (and (= .cse0 29) .cse1 (= (select v_main_a_1405 main_y) 971)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:35,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:34:35,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:35,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:35,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:35,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:35,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,709 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:35,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:35,709 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:35,784 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1406]. (let ((.cse2 (select v_main_a_1406 main_y))) (let ((.cse0 (= main_a (store v_main_a_1406 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1406 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 971) (= .cse1 30))))) [2019-05-15 10:34:35,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:35,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:35,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:35,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:35,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,947 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:35,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:35,948 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:35,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1407]. (let ((.cse1 (select v_main_a_1407 main_x))) (let ((.cse0 (= (store v_main_a_1407 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1407 main_y) 970) (= .cse1 30)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:34:35,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:34:36,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:36,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:36,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:36,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,126 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:36,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:36,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:36,189 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1408]. (let ((.cse2 (select v_main_a_1408 main_y))) (let ((.cse0 (= (store v_main_a_1408 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1408 main_x))) (or (and .cse0 (= 31 .cse1) (= 970 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:34:36,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:36,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:36,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:36,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:36,317 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,353 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:36,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:36,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:36,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1409]. (let ((.cse0 (select v_main_a_1409 main_x))) (let ((.cse1 (= (store v_main_a_1409 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 31) (= (select v_main_a_1409 main_y) 969) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:36,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:34:36,471 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:36,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:36,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:36,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:36,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,523 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:36,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:36,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:36,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1410]. (let ((.cse2 (select v_main_a_1410 main_y))) (let ((.cse1 (select v_main_a_1410 main_x)) (.cse0 (= (store v_main_a_1410 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 32) .cse0 (= .cse2 969))))) [2019-05-15 10:34:36,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:36,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:36,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:36,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:36,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,746 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:36,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:36,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:36,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,759 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1411]. (let ((.cse1 (select v_main_a_1411 main_x))) (let ((.cse0 (= (store v_main_a_1411 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 32) (= (select v_main_a_1411 main_y) 968)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:34:36,759 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:34:36,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:36,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:36,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:36,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:36,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,916 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:36,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:36,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:36,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1412]. (let ((.cse2 (select v_main_a_1412 main_y))) (let ((.cse0 (= (store v_main_a_1412 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1412 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 968) .cse0 (= .cse1 33))))) [2019-05-15 10:34:36,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:37,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:37,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:37,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:37,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,160 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:37,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:37,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:37,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1413]. (let ((.cse1 (select v_main_a_1413 main_x))) (let ((.cse0 (= (store v_main_a_1413 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 967 (select v_main_a_1413 main_y)) (= .cse1 33) .cse0)))) [2019-05-15 10:34:37,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:34:37,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:37,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:37,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:37,306 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,343 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:37,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:37,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:37,386 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1414]. (let ((.cse0 (select v_main_a_1414 main_y))) (let ((.cse1 (= (store v_main_a_1414 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1414 main_x))) (or (and (= .cse0 967) .cse1 (= .cse2 34)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:34:37,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:37,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:37,519 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:37,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:37,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,554 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:37,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:37,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:37,569 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1415]. (let ((.cse1 (select v_main_a_1415 main_x))) (let ((.cse0 (= (store v_main_a_1415 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1415 main_y) 966) (= .cse1 34)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:34:37,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:34:37,682 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:37,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:37,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:37,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:37,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,734 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:37,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:37,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:37,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1416]. (let ((.cse2 (select v_main_a_1416 main_y))) (let ((.cse0 (select v_main_a_1416 main_x)) (.cse1 (= main_a (store v_main_a_1416 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 35) (= .cse2 966) .cse1)))) [2019-05-15 10:34:37,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:34:37,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:37,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:37,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,884 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:37,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,913 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:37,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:37,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:37,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,927 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1417]. (let ((.cse1 (select v_main_a_1417 main_x))) (let ((.cse0 (= (store v_main_a_1417 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 35 .cse1) .cse0 (= 965 (select v_main_a_1417 main_y)))))) [2019-05-15 10:34:37,927 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:34:38,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:38,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:38,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:38,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:38,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:38,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:38,102 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:38,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:38,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:38,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:38,115 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1418]. (let ((.cse1 (select v_main_a_1418 main_y))) (let ((.cse2 (= (store v_main_a_1418 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1418 main_x))) (or (and (= 36 .cse0) (= 965 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse0))))) [2019-05-15 10:34:38,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:34:38,218 INFO L273 TraceCheckUtils]: 0: Hoare triple {11643#true} a := a[x := 0]; {11648#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:34:38,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {11648#(= (select main_a main_x) 0)} a := a[y := 1000]; {11652#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:34:38,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {11652#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {11656#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:34:38,221 INFO L273 TraceCheckUtils]: 3: Hoare triple {11656#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {11660#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,222 INFO L273 TraceCheckUtils]: 4: Hoare triple {11660#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11664#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:34:38,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {11664#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {11668#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {11668#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11672#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:34:38,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {11672#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {11676#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {11676#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11680#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:34:38,228 INFO L273 TraceCheckUtils]: 9: Hoare triple {11680#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {11684#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {11684#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11688#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:34:38,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {11688#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {11692#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {11692#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11696#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:34:38,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {11696#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {11700#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:34:38,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {11700#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {11704#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:34:38,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {11704#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {11708#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:34:38,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {11708#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {11712#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:34:38,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {11712#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {11716#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:34:38,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {11716#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {11720#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:34:38,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {11720#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {11724#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {11724#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11728#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:34:38,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {11728#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {11732#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {11732#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11736#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:34:38,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {11736#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {11740#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:34:38,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {11740#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {11744#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:34:38,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {11744#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {11748#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {11748#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11752#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:34:38,249 INFO L273 TraceCheckUtils]: 27: Hoare triple {11752#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {11756#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,250 INFO L273 TraceCheckUtils]: 28: Hoare triple {11756#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11760#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:34:38,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {11760#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {11764#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:34:38,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {11764#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {11768#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:34:38,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {11768#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {11772#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {11772#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11776#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:34:38,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {11776#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {11780#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {11780#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11784#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:34:38,258 INFO L273 TraceCheckUtils]: 35: Hoare triple {11784#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {11788#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:34:38,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {11788#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {11792#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:34:38,260 INFO L273 TraceCheckUtils]: 37: Hoare triple {11792#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {11796#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {11796#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11800#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:34:38,262 INFO L273 TraceCheckUtils]: 39: Hoare triple {11800#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {11804#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:34:38,263 INFO L273 TraceCheckUtils]: 40: Hoare triple {11804#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {11808#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:34:38,264 INFO L273 TraceCheckUtils]: 41: Hoare triple {11808#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {11812#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,266 INFO L273 TraceCheckUtils]: 42: Hoare triple {11812#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11816#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:34:38,267 INFO L273 TraceCheckUtils]: 43: Hoare triple {11816#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {11820#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,268 INFO L273 TraceCheckUtils]: 44: Hoare triple {11820#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11824#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:34:38,269 INFO L273 TraceCheckUtils]: 45: Hoare triple {11824#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {11828#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:34:38,270 INFO L273 TraceCheckUtils]: 46: Hoare triple {11828#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {11832#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:34:38,271 INFO L273 TraceCheckUtils]: 47: Hoare triple {11832#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {11836#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {11836#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11840#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:34:38,274 INFO L273 TraceCheckUtils]: 49: Hoare triple {11840#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {11844#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,275 INFO L273 TraceCheckUtils]: 50: Hoare triple {11844#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11848#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:34:38,276 INFO L273 TraceCheckUtils]: 51: Hoare triple {11848#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {11852#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,277 INFO L273 TraceCheckUtils]: 52: Hoare triple {11852#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11856#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:34:38,278 INFO L273 TraceCheckUtils]: 53: Hoare triple {11856#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {11860#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,279 INFO L273 TraceCheckUtils]: 54: Hoare triple {11860#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11864#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:34:38,280 INFO L273 TraceCheckUtils]: 55: Hoare triple {11864#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {11868#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,281 INFO L273 TraceCheckUtils]: 56: Hoare triple {11868#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11872#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:34:38,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {11872#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {11876#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {11876#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11880#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:34:38,285 INFO L273 TraceCheckUtils]: 59: Hoare triple {11880#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {11884#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,286 INFO L273 TraceCheckUtils]: 60: Hoare triple {11884#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11888#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:34:38,287 INFO L273 TraceCheckUtils]: 61: Hoare triple {11888#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {11892#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {11892#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11896#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:34:38,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {11896#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {11900#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,290 INFO L273 TraceCheckUtils]: 64: Hoare triple {11900#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11904#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:34:38,292 INFO L273 TraceCheckUtils]: 65: Hoare triple {11904#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {11908#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,293 INFO L273 TraceCheckUtils]: 66: Hoare triple {11908#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11912#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:34:38,294 INFO L273 TraceCheckUtils]: 67: Hoare triple {11912#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {11916#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:34:38,295 INFO L273 TraceCheckUtils]: 68: Hoare triple {11916#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {11920#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:34:38,296 INFO L273 TraceCheckUtils]: 69: Hoare triple {11920#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {11924#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:34:38,297 INFO L273 TraceCheckUtils]: 70: Hoare triple {11924#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {11928#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:34:38,298 INFO L273 TraceCheckUtils]: 71: Hoare triple {11928#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {11932#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:34:38,300 INFO L273 TraceCheckUtils]: 72: Hoare triple {11932#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {11936#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:34:38,301 INFO L273 TraceCheckUtils]: 73: Hoare triple {11936#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {11940#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:34:38,301 INFO L273 TraceCheckUtils]: 74: Hoare triple {11940#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} assume x > y && a[x] == 1000; {11644#false} is VALID [2019-05-15 10:34:38,302 INFO L273 TraceCheckUtils]: 75: Hoare triple {11644#false} assume !(a[y] <= 0); {11644#false} is VALID [2019-05-15 10:34:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:38,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:38,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-15 10:34:38,325 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-05-15 10:34:38,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:38,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states. [2019-05-15 10:34:38,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:38,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-05-15 10:34:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-15 10:34:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-05-15 10:34:38,422 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-05-15 10:34:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:52,795 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:34:52,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-15 10:34:52,796 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-05-15 10:34:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-05-15 10:34:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-05-15 10:34:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-05-15 10:34:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-05-15 10:34:52,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2019-05-15 10:34:52,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:52,898 INFO L225 Difference]: With dead ends: 79 [2019-05-15 10:34:52,898 INFO L226 Difference]: Without dead ends: 79 [2019-05-15 10:34:52,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-05-15 10:34:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-05-15 10:34:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-05-15 10:34:52,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:52,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2019-05-15 10:34:52,901 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2019-05-15 10:34:52,901 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2019-05-15 10:34:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:52,902 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:34:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:34:52,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:52,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:52,902 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2019-05-15 10:34:52,902 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2019-05-15 10:34:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:52,903 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:34:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:34:52,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:52,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:52,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:52,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-05-15 10:34:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-05-15 10:34:52,905 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-05-15 10:34:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:52,905 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-05-15 10:34:52,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-05-15 10:34:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:34:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-05-15 10:34:52,905 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:52,905 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-05-15 10:34:52,905 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:52,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:52,906 INFO L82 PathProgramCache]: Analyzing trace with hash 247770504, now seen corresponding path program 37 times [2019-05-15 10:34:52,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:52,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-15 10:34:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:53,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:53,051 INFO L375 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 6 treesize of output 5 [2019-05-15 10:34:53,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:53,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1419]. (= (store v_main_a_1419 main_x 0) main_a) [2019-05-15 10:34:53,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:34:53,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:34:53,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,097 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:34:53,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:34:53,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1420]. (and (= (select v_main_a_1420 main_x) 0) (= (store v_main_a_1420 main_y 1000) main_a)) [2019-05-15 10:34:53,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:34:53,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:53,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:53,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,145 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:53,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,171 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:53,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:53,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:53,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1421]. (let ((.cse2 (select v_main_a_1421 main_x))) (let ((.cse0 (= (select v_main_a_1421 main_y) 1000)) (.cse1 (= main_a (store v_main_a_1421 main_x (+ .cse2 1))))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 (= .cse2 0) .cse1)))) [2019-05-15 10:34:53,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:34:53,211 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:53,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:53,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:53,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,258 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:53,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:53,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:53,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1422]. (let ((.cse2 (select v_main_a_1422 main_y))) (let ((.cse0 (select v_main_a_1422 main_x)) (.cse1 (= (store v_main_a_1422 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 1) .cse1 (= .cse2 1000))))) [2019-05-15 10:34:53,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:53,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,378 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:53,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:53,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,421 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:53,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:53,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:53,433 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,434 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1423]. (let ((.cse1 (select v_main_a_1423 main_x))) (let ((.cse0 (= main_a (store v_main_a_1423 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 1) (= (select v_main_a_1423 main_y) 999)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:34:53,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:34:53,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,483 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:53,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:53,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,526 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:53,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:53,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:53,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1424]. (let ((.cse2 (select v_main_a_1424 main_y))) (let ((.cse0 (= (store v_main_a_1424 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1424 main_x))) (or (and .cse0 (= .cse1 2) (= .cse2 999)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:34:53,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:53,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:53,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:53,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,640 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:53,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:53,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:53,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1425]. (let ((.cse1 (select v_main_a_1425 main_x))) (let ((.cse0 (= (store v_main_a_1425 main_x (+ .cse1 1)) main_a))) (or (and (= 998 (select v_main_a_1425 main_y)) .cse0 (= 2 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:34:53,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:34:53,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:53,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:53,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,735 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:53,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:53,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:53,760 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1426]. (let ((.cse0 (select v_main_a_1426 main_y))) (let ((.cse2 (select v_main_a_1426 main_x)) (.cse1 (= (store v_main_a_1426 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 998 .cse0) .cse1 (= .cse2 3)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:34:53,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:53,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:53,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:53,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,844 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:53,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:53,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:53,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1427]. (let ((.cse0 (select v_main_a_1427 main_x))) (let ((.cse1 (= (store v_main_a_1427 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 3) .cse1 (= (select v_main_a_1427 main_y) 997)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:53,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:34:53,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:53,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:53,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:53,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,941 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:53,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:53,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:53,955 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,955 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1428]. (let ((.cse2 (select v_main_a_1428 main_y))) (let ((.cse0 (= (store v_main_a_1428 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1428 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 997) (= .cse1 4))))) [2019-05-15 10:34:53,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:53,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:53,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:53,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:54,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,051 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:54,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:54,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:54,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1429]. (let ((.cse0 (select v_main_a_1429 main_x))) (let ((.cse1 (= (store v_main_a_1429 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 4) (= (select v_main_a_1429 main_y) 996))))) [2019-05-15 10:34:54,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:34:54,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:54,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:54,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:54,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:54,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,146 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:54,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:54,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:54,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1430]. (let ((.cse2 (select v_main_a_1430 main_y))) (let ((.cse0 (select v_main_a_1430 main_x)) (.cse1 (= main_a (store v_main_a_1430 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 5 .cse0) (= 996 .cse2) .cse1)))) [2019-05-15 10:34:54,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:54,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:54,270 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:54,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:54,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,301 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:54,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:54,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:54,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1431]. (let ((.cse0 (select v_main_a_1431 main_x))) (let ((.cse1 (= (store v_main_a_1431 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1431 main_y) 995) (= .cse0 5) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:54,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:34:54,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:54,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:54,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:54,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,378 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:54,380 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,416 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:54,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:54,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:54,463 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1432]. (let ((.cse2 (select v_main_a_1432 main_y))) (let ((.cse0 (select v_main_a_1432 main_x)) (.cse1 (= (store v_main_a_1432 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 6 .cse0) .cse1 (= 995 .cse2))))) [2019-05-15 10:34:54,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:54,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:54,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:54,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,527 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:54,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,552 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:54,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:54,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:54,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1433]. (let ((.cse1 (select v_main_a_1433 main_x))) (let ((.cse0 (= main_a (store v_main_a_1433 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= 994 (select v_main_a_1433 main_y)) (= .cse1 6))))) [2019-05-15 10:34:54,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:34:54,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:54,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:54,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:54,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:54,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,654 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:54,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:54,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:54,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,667 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1434]. (let ((.cse2 (select v_main_a_1434 main_y))) (let ((.cse1 (select v_main_a_1434 main_x)) (.cse0 (= (store v_main_a_1434 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 7) (= .cse2 994) .cse0)))) [2019-05-15 10:34:54,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:34:54,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:54,731 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:54,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:54,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,763 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:54,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:54,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:54,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1435]. (let ((.cse1 (select v_main_a_1435 main_x))) (let ((.cse0 (= (store v_main_a_1435 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1435 main_y) 993) (= 7 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:34:54,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:34:54,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:54,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:54,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:54,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,876 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:54,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:54,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:54,924 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1436]. (let ((.cse2 (select v_main_a_1436 main_y))) (let ((.cse1 (select v_main_a_1436 main_x)) (.cse0 (= (store v_main_a_1436 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= .cse1 8) (= 993 .cse2)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:34:54,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:54,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:54,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:54,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:55,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,026 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:55,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:55,026 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:55,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1437]. (let ((.cse0 (select v_main_a_1437 main_x))) (let ((.cse1 (= (store v_main_a_1437 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 992 (select v_main_a_1437 main_y)) (= .cse0 8) .cse1)))) [2019-05-15 10:34:55,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:34:55,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:55,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:55,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:55,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:55,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,135 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:55,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:55,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:55,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1438]. (let ((.cse2 (select v_main_a_1438 main_y))) (let ((.cse0 (select v_main_a_1438 main_x)) (.cse1 (= (store v_main_a_1438 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 9) .cse1 (= .cse2 992))))) [2019-05-15 10:34:55,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:34:55,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:55,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:55,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:55,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,256 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:55,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:55,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:55,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1439]. (let ((.cse1 (select v_main_a_1439 main_x))) (let ((.cse0 (= (store v_main_a_1439 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 9) (= (select v_main_a_1439 main_y) 991)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:34:55,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:34:55,318 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:55,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:55,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:55,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:55,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,368 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:55,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:55,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:55,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1440]. (let ((.cse2 (select v_main_a_1440 main_y))) (let ((.cse0 (= (store v_main_a_1440 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1440 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 991) .cse0 (= .cse1 10))))) [2019-05-15 10:34:55,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:55,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:55,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:55,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:55,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,508 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:55,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:55,509 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:55,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,520 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1441]. (let ((.cse0 (select v_main_a_1441 main_x))) (let ((.cse1 (= main_a (store v_main_a_1441 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1441 main_y) 990) .cse1 (= .cse0 10))))) [2019-05-15 10:34:55,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:34:55,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:55,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:55,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:55,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:55,602 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,626 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:55,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:55,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:55,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1442]. (let ((.cse2 (select v_main_a_1442 main_y))) (let ((.cse0 (select v_main_a_1442 main_x)) (.cse1 (= (store v_main_a_1442 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 990) (= .cse0 11) .cse1)))) [2019-05-15 10:34:55,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:34:55,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:55,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:55,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:55,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,747 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:55,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:55,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:55,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1443]. (let ((.cse0 (select v_main_a_1443 main_x))) (let ((.cse1 (= (store v_main_a_1443 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 11) .cse1 (= (select v_main_a_1443 main_y) 989))))) [2019-05-15 10:34:55,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:34:55,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:55,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:55,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:55,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,870 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:55,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:55,871 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:55,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1444]. (let ((.cse1 (select v_main_a_1444 main_y))) (let ((.cse0 (= (store v_main_a_1444 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1444 main_x))) (or (and .cse0 (= .cse1 989) (= .cse2 12)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:34:55,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:56,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:56,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:56,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:56,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,080 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:56,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:56,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:56,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1445]. (let ((.cse1 (select v_main_a_1445 main_x))) (let ((.cse0 (= (store v_main_a_1445 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 12) (= (select v_main_a_1445 main_y) 988)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:34:56,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:34:56,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:56,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:56,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:56,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:56,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,210 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:56,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:56,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:56,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1446]. (let ((.cse2 (select v_main_a_1446 main_y))) (let ((.cse0 (select v_main_a_1446 main_x)) (.cse1 (= (store v_main_a_1446 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 13 .cse0) (= .cse2 988) .cse1)))) [2019-05-15 10:34:56,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:56,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:56,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:56,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:56,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,394 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:56,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:56,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:56,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1447]. (let ((.cse1 (select v_main_a_1447 main_x))) (let ((.cse0 (= (store v_main_a_1447 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 13 .cse1) (= 987 (select v_main_a_1447 main_y)))))) [2019-05-15 10:34:56,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:34:56,468 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:56,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:56,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:56,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:56,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,529 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:56,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:56,530 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:56,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1448]. (let ((.cse2 (select v_main_a_1448 main_y))) (let ((.cse0 (= main_a (store v_main_a_1448 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1448 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 14) (= .cse2 987))))) [2019-05-15 10:34:56,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:34:56,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:56,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:56,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:56,639 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,664 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:56,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:56,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:56,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1449]. (let ((.cse0 (select v_main_a_1449 main_x))) (let ((.cse1 (= (store v_main_a_1449 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 14) (= (select v_main_a_1449 main_y) 986) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:34:56,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:34:56,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:56,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:56,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:56,773 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,798 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:56,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:56,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:56,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1450]. (let ((.cse1 (select v_main_a_1450 main_y))) (let ((.cse0 (= (store v_main_a_1450 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1450 main_x))) (or (and .cse0 (= .cse1 986) (= .cse2 15)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:34:56,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:56,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:56,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:56,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:56,940 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,965 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:56,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:56,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:56,978 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,978 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1451]. (let ((.cse1 (select v_main_a_1451 main_x))) (let ((.cse0 (= (store v_main_a_1451 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 15) (= (select v_main_a_1451 main_y) 985))))) [2019-05-15 10:34:56,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:34:57,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:57,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:57,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:57,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:57,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:57,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,108 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:57,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:57,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:57,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:57,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1452]. (let ((.cse2 (select v_main_a_1452 main_y))) (let ((.cse0 (= (store v_main_a_1452 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1452 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 985) (= .cse1 16))))) [2019-05-15 10:34:57,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:57,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:57,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:57,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:57,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:57,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,266 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:57,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:57,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:57,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:57,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1453]. (let ((.cse1 (select v_main_a_1453 main_x))) (let ((.cse0 (= (store v_main_a_1453 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 16) .cse0 (= (select v_main_a_1453 main_y) 984))))) [2019-05-15 10:34:57,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:34:57,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:57,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:57,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:57,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:57,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:57,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,398 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:57,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:57,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:57,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:57,409 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1454]. (let ((.cse2 (select v_main_a_1454 main_y))) (let ((.cse0 (select v_main_a_1454 main_x)) (.cse1 (= (store v_main_a_1454 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 984) (= 17 .cse0) .cse1)))) [2019-05-15 10:34:57,409 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:34:57,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:57,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:57,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:57,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:57,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,533 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:57,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:57,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:57,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:57,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1455]. (let ((.cse0 (select v_main_a_1455 main_x))) (let ((.cse1 (= (store v_main_a_1455 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1455 main_y) 983) (= .cse0 17) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:34:57,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:34:57,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:57,634 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:57,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:57,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:57,644 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,679 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:57,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:57,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:57,708 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:57,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1456]. (let ((.cse0 (select v_main_a_1456 main_y))) (let ((.cse2 (select v_main_a_1456 main_x)) (.cse1 (= (store v_main_a_1456 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 983) .cse1 (= .cse2 18)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:34:57,708 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:57,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:57,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:57,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:57,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:57,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,846 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:57,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:57,847 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:57,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:57,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1457]. (let ((.cse1 (select v_main_a_1457 main_x))) (let ((.cse0 (= main_a (store v_main_a_1457 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 18) .cse0 (= 982 (select v_main_a_1457 main_y)))))) [2019-05-15 10:34:57,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:34:57,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:57,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:57,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:57,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,950 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:57,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:57,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:57,976 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:57,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:57,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:57,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:57,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1458]. (let ((.cse2 (select v_main_a_1458 main_y))) (let ((.cse0 (select v_main_a_1458 main_x)) (.cse1 (= (store v_main_a_1458 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 19) (= .cse2 982) .cse1)))) [2019-05-15 10:34:57,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:34:58,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:58,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:58,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:58,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:58,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,108 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:58,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:58,109 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:58,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:58,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1459]. (let ((.cse1 (select v_main_a_1459 main_x))) (let ((.cse0 (= main_a (store v_main_a_1459 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1459 main_y) 981) (= .cse1 19)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:34:58,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:34:58,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:58,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:58,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:58,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:58,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:58,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,257 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:58,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:58,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:58,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:58,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1460]. (let ((.cse2 (select v_main_a_1460 main_y))) (let ((.cse0 (select v_main_a_1460 main_x)) (.cse1 (= (store v_main_a_1460 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 981) (= .cse0 20) .cse1)))) [2019-05-15 10:34:58,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:58,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:58,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:58,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:58,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:58,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,445 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:58,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:58,445 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:58,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:58,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1461]. (let ((.cse1 (select v_main_a_1461 main_x))) (let ((.cse0 (= (store v_main_a_1461 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 20) (= (select v_main_a_1461 main_y) 980))))) [2019-05-15 10:34:58,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:34:58,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:58,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:58,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:58,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:58,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,584 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:58,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:58,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:58,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:58,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1462]. (let ((.cse1 (select v_main_a_1462 main_y))) (let ((.cse2 (= (store v_main_a_1462 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1462 main_x))) (or (and (= 21 .cse0) (= 980 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse0))))) [2019-05-15 10:34:58,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:58,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:58,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:58,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:58,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:58,738 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,773 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:58,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:58,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:58,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:58,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1463]. (let ((.cse1 (select v_main_a_1463 main_x))) (let ((.cse0 (= (store v_main_a_1463 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= .cse1 21) (= (select v_main_a_1463 main_y) 979))))) [2019-05-15 10:34:58,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:34:58,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:58,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:58,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:58,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,884 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:58,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:58,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:58,920 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:58,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:58,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:58,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:58,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1464]. (let ((.cse2 (select v_main_a_1464 main_y))) (let ((.cse0 (= (store v_main_a_1464 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1464 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 979) (= .cse1 22))))) [2019-05-15 10:34:58,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:34:59,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:59,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:59,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:59,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:59,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,060 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:59,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:59,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:59,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:59,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1465]. (let ((.cse1 (select v_main_a_1465 main_x))) (let ((.cse0 (= (store v_main_a_1465 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1465 main_y) 978) .cse0 (= .cse1 22))))) [2019-05-15 10:34:59,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:34:59,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:59,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:59,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:59,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:59,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,215 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:59,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:59,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:59,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:59,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1466]. (let ((.cse2 (select v_main_a_1466 main_y))) (let ((.cse1 (= (store v_main_a_1466 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1466 main_x))) (or (and (= .cse0 23) .cse1 (= .cse2 978)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:34:59,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:59,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:59,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:59,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:59,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:59,401 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,425 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:59,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:59,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:59,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:59,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1467]. (let ((.cse1 (select v_main_a_1467 main_x))) (let ((.cse0 (= (store v_main_a_1467 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 23) (= (select v_main_a_1467 main_y) 977))))) [2019-05-15 10:34:59,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:34:59,522 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:34:59,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:59,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:59,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:59,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:59,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,570 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:59,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:59,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:59,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:59,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1468]. (let ((.cse2 (select v_main_a_1468 main_y))) (let ((.cse0 (select v_main_a_1468 main_x)) (.cse1 (= (store v_main_a_1468 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 24) (= 977 .cse2) .cse1)))) [2019-05-15 10:34:59,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:34:59,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:59,730 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:59,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:59,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:34:59,737 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,773 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:59,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:59,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:59,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:59,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1469]. (let ((.cse1 (select v_main_a_1469 main_x))) (let ((.cse0 (= (store v_main_a_1469 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1469 main_y) 976) .cse0 (= .cse1 24)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:34:59,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:34:59,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:34:59,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:59,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:34:59,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:34:59,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:59,922 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:34:59,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:34:59,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:34:59,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:59,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1470]. (let ((.cse2 (select v_main_a_1470 main_y))) (let ((.cse1 (= (store v_main_a_1470 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1470 main_x))) (or (and (= 25 .cse0) .cse1 (= .cse2 976)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:34:59,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:00,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:00,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:00,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,061 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:00,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:00,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,088 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:00,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:00,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:00,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:00,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1471]. (let ((.cse1 (select v_main_a_1471 main_x))) (let ((.cse0 (= (store v_main_a_1471 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= (select v_main_a_1471 main_y) 975) (= .cse1 25))))) [2019-05-15 10:35:00,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:35:00,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:00,221 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:00,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:00,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:00,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,265 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:00,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:00,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:00,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:00,332 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1472]. (let ((.cse0 (select v_main_a_1472 main_y))) (let ((.cse1 (select v_main_a_1472 main_x)) (.cse2 (= (store v_main_a_1472 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 975 .cse0) (= 26 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:35:00,332 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:00,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:00,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:00,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:00,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:00,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,469 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:00,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:00,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:00,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:00,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1473]. (let ((.cse1 (select v_main_a_1473 main_x))) (let ((.cse0 (= (store v_main_a_1473 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 26) (= 974 (select v_main_a_1473 main_y)))))) [2019-05-15 10:35:00,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:35:00,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:00,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:00,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:00,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:00,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:00,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,624 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:00,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:00,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:00,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:00,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1474]. (let ((.cse2 (select v_main_a_1474 main_y))) (let ((.cse0 (= (store v_main_a_1474 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1474 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 974) (= .cse1 27))))) [2019-05-15 10:35:00,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:00,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:00,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:00,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:00,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:00,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,843 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:00,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:00,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:00,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:00,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1475]. (let ((.cse1 (select v_main_a_1475 main_x))) (let ((.cse0 (= (store v_main_a_1475 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 27) (= (select v_main_a_1475 main_y) 973)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:35:00,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:35:00,946 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:00,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:00,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:00,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:00,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:00,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:00,993 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:00,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:00,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:01,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:01,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1476]. (let ((.cse2 (select v_main_a_1476 main_y))) (let ((.cse0 (select v_main_a_1476 main_x)) (.cse1 (= (store v_main_a_1476 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 28) .cse1 (= .cse2 973))))) [2019-05-15 10:35:01,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:01,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:01,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:01,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:01,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:01,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,209 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:01,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:01,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:01,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:01,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1477]. (let ((.cse1 (select v_main_a_1477 main_x))) (let ((.cse0 (= (store v_main_a_1477 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 972 (select v_main_a_1477 main_y)) (= 28 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:35:01,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:35:01,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:01,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:01,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:01,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:01,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:01,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,364 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:01,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:01,364 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:01,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:01,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1478]. (let ((.cse2 (select v_main_a_1478 main_y))) (let ((.cse1 (= (store v_main_a_1478 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1478 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 972) .cse1 (= 29 .cse0))))) [2019-05-15 10:35:01,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:01,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:01,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:01,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:01,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:01,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,584 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:01,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:01,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:01,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:01,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1479]. (let ((.cse1 (select v_main_a_1479 main_x))) (let ((.cse0 (= (store v_main_a_1479 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= (select v_main_a_1479 main_y) 971) (= .cse1 29))))) [2019-05-15 10:35:01,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:35:01,695 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:01,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:01,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:01,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:01,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:01,719 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,755 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:01,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:01,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:01,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:01,783 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1480]. (let ((.cse2 (select v_main_a_1480 main_y))) (let ((.cse1 (select v_main_a_1480 main_x)) (.cse0 (= (store v_main_a_1480 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 30 .cse1) .cse0 (= 971 .cse2))))) [2019-05-15 10:35:01,783 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:01,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:01,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:01,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:01,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:01,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:01,941 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:01,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:01,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:01,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:01,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1481]. (let ((.cse0 (select v_main_a_1481 main_x))) (let ((.cse1 (= (store v_main_a_1481 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 30) .cse1 (= (select v_main_a_1481 main_y) 970))))) [2019-05-15 10:35:01,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:35:02,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:02,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:02,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:02,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:02,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:02,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,121 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:02,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:02,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:02,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:02,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1482]. (let ((.cse2 (select v_main_a_1482 main_y))) (let ((.cse0 (= (store v_main_a_1482 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1482 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 31 .cse1) (= 970 .cse2))))) [2019-05-15 10:35:02,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:02,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:02,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:02,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:02,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:02,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,344 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:02,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:02,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:02,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:02,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1483]. (let ((.cse0 (select v_main_a_1483 main_x))) (let ((.cse1 (= (store v_main_a_1483 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 969 (select v_main_a_1483 main_y)) .cse1 (= 31 .cse0))))) [2019-05-15 10:35:02,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:35:02,463 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:02,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:02,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:02,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:02,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:02,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,512 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:02,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:02,513 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:02,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:02,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1484]. (let ((.cse2 (select v_main_a_1484 main_y))) (let ((.cse1 (= (store v_main_a_1484 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1484 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 969 .cse2) .cse1 (= 32 .cse0))))) [2019-05-15 10:35:02,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:02,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:02,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:02,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:02,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:02,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,747 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:02,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:02,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:02,760 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:02,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1485]. (let ((.cse0 (select v_main_a_1485 main_x))) (let ((.cse1 (= (store v_main_a_1485 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 32) .cse1 (= (select v_main_a_1485 main_y) 968))))) [2019-05-15 10:35:02,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:35:02,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:02,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:02,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:02,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:02,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:02,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:02,915 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:02,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:02,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:02,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:02,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1486]. (let ((.cse2 (select v_main_a_1486 main_y))) (let ((.cse1 (select v_main_a_1486 main_x)) (.cse0 (= (store v_main_a_1486 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 33 .cse1) (= .cse2 968) .cse0)))) [2019-05-15 10:35:02,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:03,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:03,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:03,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:03,135 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,172 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:03,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:03,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:03,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,182 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1487]. (let ((.cse1 (select v_main_a_1487 main_x))) (let ((.cse0 (= (store v_main_a_1487 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 33 .cse1) (= 967 (select v_main_a_1487 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:35:03,182 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:35:03,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:03,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:03,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:03,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,388 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:03,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:03,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:03,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1488]. (let ((.cse0 (select v_main_a_1488 main_y))) (let ((.cse2 (select v_main_a_1488 main_x)) (.cse1 (= (store v_main_a_1488 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 967) .cse1 (= .cse2 34)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:35:03,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:03,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:03,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:03,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:03,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,607 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:03,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:03,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:03,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1489]. (let ((.cse1 (select v_main_a_1489 main_x))) (let ((.cse0 (= (store v_main_a_1489 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 34) (= (select v_main_a_1489 main_y) 966) .cse0)))) [2019-05-15 10:35:03,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:35:03,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:03,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:03,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:03,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,803 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:03,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:03,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:03,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1490]. (let ((.cse0 (select v_main_a_1490 main_y))) (let ((.cse2 (select v_main_a_1490 main_x)) (.cse1 (= (store v_main_a_1490 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 966 .cse0) .cse1 (= 35 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:35:03,815 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:35:03,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:03,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:03,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:03,944 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,970 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:03,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:03,970 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:03,982 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1491]. (let ((.cse0 (select v_main_a_1491 main_x))) (let ((.cse1 (= (store v_main_a_1491 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 35) (= (select v_main_a_1491 main_y) 965) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:35:03,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:35:04,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:04,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:04,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:04,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,140 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:04,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:04,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:04,151 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,151 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1492]. (let ((.cse2 (select v_main_a_1492 main_y))) (let ((.cse1 (select v_main_a_1492 main_x)) (.cse0 (= (store v_main_a_1492 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 36 .cse1) (= 965 .cse2)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:35:04,151 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:35:04,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:04,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:04,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:04,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,310 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:04,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:04,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:04,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1493]. (let ((.cse1 (select v_main_a_1493 main_x))) (let ((.cse0 (= (store v_main_a_1493 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1493 main_y) 964) (= .cse1 36)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:04,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:35:04,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:04,450 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:04,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:04,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,483 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:04,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:04,483 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:04,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1494]. (let ((.cse0 (select v_main_a_1494 main_y))) (let ((.cse1 (select v_main_a_1494 main_x)) (.cse2 (= (store v_main_a_1494 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 964) (= .cse1 37) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:35:04,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:04,645 INFO L273 TraceCheckUtils]: 0: Hoare triple {12262#true} a := a[x := 0]; {12267#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:35:04,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {12267#(= (select main_a main_x) 0)} a := a[y := 1000]; {12271#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:35:04,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {12271#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {12275#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:35:04,649 INFO L273 TraceCheckUtils]: 3: Hoare triple {12275#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {12279#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,650 INFO L273 TraceCheckUtils]: 4: Hoare triple {12279#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12283#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:35:04,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {12283#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {12287#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {12287#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12291#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:35:04,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {12291#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {12295#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {12295#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12299#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:35:04,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {12299#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {12303#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {12303#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12307#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:35:04,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {12307#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {12311#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {12311#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12315#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:35:04,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {12315#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {12319#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:35:04,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {12319#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {12323#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:35:04,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {12323#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {12327#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:35:04,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {12327#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {12331#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:35:04,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {12331#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {12335#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:35:04,666 INFO L273 TraceCheckUtils]: 18: Hoare triple {12335#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {12339#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:35:04,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {12339#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {12343#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,669 INFO L273 TraceCheckUtils]: 20: Hoare triple {12343#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12347#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:35:04,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {12347#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {12351#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {12351#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12355#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:35:04,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {12355#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {12359#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:35:04,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {12359#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {12363#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:35:04,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {12363#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {12367#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {12367#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12371#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:35:04,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {12371#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {12375#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {12375#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12379#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:35:04,679 INFO L273 TraceCheckUtils]: 29: Hoare triple {12379#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {12383#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:35:04,681 INFO L273 TraceCheckUtils]: 30: Hoare triple {12383#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {12387#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:35:04,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {12387#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {12391#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {12391#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12395#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:35:04,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {12395#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {12399#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {12399#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12403#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:35:04,687 INFO L273 TraceCheckUtils]: 35: Hoare triple {12403#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {12407#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:35:04,688 INFO L273 TraceCheckUtils]: 36: Hoare triple {12407#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {12411#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:35:04,689 INFO L273 TraceCheckUtils]: 37: Hoare triple {12411#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {12415#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {12415#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12419#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:35:04,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {12419#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {12423#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:35:04,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {12423#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {12427#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:35:04,694 INFO L273 TraceCheckUtils]: 41: Hoare triple {12427#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {12431#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {12431#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12435#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:35:04,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {12435#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {12439#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {12439#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12443#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:35:04,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {12443#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {12447#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:35:04,700 INFO L273 TraceCheckUtils]: 46: Hoare triple {12447#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {12451#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:35:04,701 INFO L273 TraceCheckUtils]: 47: Hoare triple {12451#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {12455#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {12455#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12459#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:35:04,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {12459#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {12463#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {12463#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12467#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:35:04,706 INFO L273 TraceCheckUtils]: 51: Hoare triple {12467#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {12471#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,707 INFO L273 TraceCheckUtils]: 52: Hoare triple {12471#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12475#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:35:04,708 INFO L273 TraceCheckUtils]: 53: Hoare triple {12475#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {12479#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,709 INFO L273 TraceCheckUtils]: 54: Hoare triple {12479#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12483#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:35:04,711 INFO L273 TraceCheckUtils]: 55: Hoare triple {12483#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {12487#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,712 INFO L273 TraceCheckUtils]: 56: Hoare triple {12487#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12491#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:35:04,713 INFO L273 TraceCheckUtils]: 57: Hoare triple {12491#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {12495#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,714 INFO L273 TraceCheckUtils]: 58: Hoare triple {12495#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12499#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:35:04,715 INFO L273 TraceCheckUtils]: 59: Hoare triple {12499#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {12503#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,716 INFO L273 TraceCheckUtils]: 60: Hoare triple {12503#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12507#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:35:04,717 INFO L273 TraceCheckUtils]: 61: Hoare triple {12507#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {12511#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {12511#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12515#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:35:04,720 INFO L273 TraceCheckUtils]: 63: Hoare triple {12515#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {12519#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,721 INFO L273 TraceCheckUtils]: 64: Hoare triple {12519#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12523#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:35:04,722 INFO L273 TraceCheckUtils]: 65: Hoare triple {12523#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {12527#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,723 INFO L273 TraceCheckUtils]: 66: Hoare triple {12527#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12531#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:35:04,725 INFO L273 TraceCheckUtils]: 67: Hoare triple {12531#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {12535#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,726 INFO L273 TraceCheckUtils]: 68: Hoare triple {12535#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12539#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:35:04,727 INFO L273 TraceCheckUtils]: 69: Hoare triple {12539#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {12543#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:35:04,728 INFO L273 TraceCheckUtils]: 70: Hoare triple {12543#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {12547#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:35:04,729 INFO L273 TraceCheckUtils]: 71: Hoare triple {12547#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {12551#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:35:04,731 INFO L273 TraceCheckUtils]: 72: Hoare triple {12551#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {12555#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:35:04,732 INFO L273 TraceCheckUtils]: 73: Hoare triple {12555#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {12559#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:35:04,733 INFO L273 TraceCheckUtils]: 74: Hoare triple {12559#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {12563#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:35:04,734 INFO L273 TraceCheckUtils]: 75: Hoare triple {12563#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {12567#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:04,735 INFO L273 TraceCheckUtils]: 76: Hoare triple {12567#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {12263#false} is VALID [2019-05-15 10:35:04,735 INFO L273 TraceCheckUtils]: 77: Hoare triple {12263#false} assume !(a[y] <= 0); {12263#false} is VALID [2019-05-15 10:35:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:04,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:04,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-15 10:35:04,760 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-05-15 10:35:04,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:04,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states. [2019-05-15 10:35:04,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:04,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-05-15 10:35:04,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-15 10:35:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-05-15 10:35:04,863 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-05-15 10:35:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:19,941 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:35:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-15 10:35:19,941 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-05-15 10:35:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-05-15 10:35:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-05-15 10:35:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-05-15 10:35:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-05-15 10:35:19,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 82 transitions. [2019-05-15 10:35:20,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:20,061 INFO L225 Difference]: With dead ends: 81 [2019-05-15 10:35:20,061 INFO L226 Difference]: Without dead ends: 81 [2019-05-15 10:35:20,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-05-15 10:35:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-05-15 10:35:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-05-15 10:35:20,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:20,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2019-05-15 10:35:20,063 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2019-05-15 10:35:20,063 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2019-05-15 10:35:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:20,064 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:35:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:35:20,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:20,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:20,065 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2019-05-15 10:35:20,065 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2019-05-15 10:35:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:20,066 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:35:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:35:20,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:20,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:20,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:20,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-05-15 10:35:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-05-15 10:35:20,067 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-05-15 10:35:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:20,067 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-05-15 10:35:20,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-05-15 10:35:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:35:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-05-15 10:35:20,068 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:20,068 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-05-15 10:35:20,068 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1884099625, now seen corresponding path program 38 times [2019-05-15 10:35:20,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:20,168 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-15 10:35:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:20,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:20,230 INFO L375 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 6 treesize of output 5 [2019-05-15 10:35:20,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:20,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,237 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1495]. (= (store v_main_a_1495 main_x 0) main_a) [2019-05-15 10:35:20,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:35:20,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:35:20,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,281 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:35:20,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:35:20,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1496]. (and (= (select v_main_a_1496 main_x) 0) (= (store v_main_a_1496 main_y 1000) main_a)) [2019-05-15 10:35:20,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:35:20,309 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:20,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:20,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:20,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:20,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,357 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:20,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:20,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:20,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,380 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1497]. (let ((.cse2 (select v_main_a_1497 main_x))) (let ((.cse0 (= (store v_main_a_1497 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_1497 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 (= .cse2 0) .cse1)))) [2019-05-15 10:35:20,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:35:20,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:20,430 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:20,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:20,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,461 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:20,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:20,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:20,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,516 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1498]. (let ((.cse2 (select v_main_a_1498 main_y))) (let ((.cse0 (select v_main_a_1498 main_x)) (.cse1 (= (store v_main_a_1498 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 1) .cse1 (= .cse2 1000)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:35:20,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:20,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:20,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:20,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,569 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:20,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,608 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:20,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:20,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:20,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,620 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1499]. (let ((.cse1 (select v_main_a_1499 main_x))) (let ((.cse0 (= (store v_main_a_1499 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= (select v_main_a_1499 main_y) 999) (= .cse1 1))))) [2019-05-15 10:35:20,620 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:35:20,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:20,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:20,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:20,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:20,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,713 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:20,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:20,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:20,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1500]. (let ((.cse2 (select v_main_a_1500 main_y))) (let ((.cse0 (= (store v_main_a_1500 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1500 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 999) (= 2 .cse1))))) [2019-05-15 10:35:20,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:20,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:20,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:20,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:20,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,836 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:20,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:20,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:20,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1501]. (let ((.cse0 (select v_main_a_1501 main_x))) (let ((.cse1 (= (store v_main_a_1501 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 2) (= 998 (select v_main_a_1501 main_y)))))) [2019-05-15 10:35:20,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:35:20,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:20,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:20,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:20,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:20,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,938 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:20,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:20,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:20,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1502]. (let ((.cse2 (select v_main_a_1502 main_y))) (let ((.cse0 (select v_main_a_1502 main_x)) (.cse1 (= (store v_main_a_1502 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 998) (= .cse0 3) .cse1)))) [2019-05-15 10:35:20,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:21,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:21,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:21,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:21,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,074 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:21,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:21,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:21,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1503]. (let ((.cse1 (select v_main_a_1503 main_x))) (let ((.cse0 (= (store v_main_a_1503 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1503 main_y) 997) (= 3 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:35:21,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:35:21,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:21,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:21,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:21,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,146 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:21,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,172 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:21,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:21,173 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:21,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1504]. (let ((.cse2 (select v_main_a_1504 main_y))) (let ((.cse0 (select v_main_a_1504 main_x)) (.cse1 (= (store v_main_a_1504 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 4 .cse0) .cse1 (= 997 .cse2))))) [2019-05-15 10:35:21,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:21,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:21,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:21,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:21,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,325 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:21,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:21,325 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:21,335 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1505]. (let ((.cse1 (select v_main_a_1505 main_x))) (let ((.cse0 (= main_a (store v_main_a_1505 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1505 main_y) 996) (= .cse1 4)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:21,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:35:21,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:21,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:21,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:21,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:21,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,427 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:21,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:21,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:21,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1506]. (let ((.cse2 (select v_main_a_1506 main_y))) (let ((.cse0 (select v_main_a_1506 main_x)) (.cse1 (= (store v_main_a_1506 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 5) .cse1 (= 996 .cse2))))) [2019-05-15 10:35:21,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:21,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:21,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:21,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:21,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,589 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:21,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:21,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:21,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1507]. (let ((.cse0 (select v_main_a_1507 main_x))) (let ((.cse1 (= (store v_main_a_1507 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1507 main_y) 995) (= .cse0 5) .cse1)))) [2019-05-15 10:35:21,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:35:21,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:21,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:21,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:21,669 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,705 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:21,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:21,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:21,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1508]. (let ((.cse0 (select v_main_a_1508 main_y))) (let ((.cse2 (select v_main_a_1508 main_x)) (.cse1 (= (store v_main_a_1508 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 995) .cse1 (= .cse2 6)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:35:21,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:21,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:21,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:21,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:21,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,823 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:21,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:21,823 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:21,834 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1509]. (let ((.cse0 (select v_main_a_1509 main_x))) (let ((.cse1 (= (store v_main_a_1509 main_x (+ .cse0 1)) main_a))) (or (and (= 6 .cse0) .cse1 (= (select v_main_a_1509 main_y) 994)) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:35:21,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:35:21,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:21,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:21,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:21,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,932 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:21,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:21,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:21,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,966 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1510]. (let ((.cse2 (select v_main_a_1510 main_y))) (let ((.cse0 (= main_a (store v_main_a_1510 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1510 main_x))) (or (and .cse0 (= 7 .cse1) (= .cse2 994)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:35:21,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:35:22,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:22,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,033 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,060 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:22,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1511]. (let ((.cse0 (select v_main_a_1511 main_x))) (let ((.cse1 (= (store v_main_a_1511 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 7) (= (select v_main_a_1511 main_y) 993))))) [2019-05-15 10:35:22,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:35:22,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:22,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:22,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,169 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:22,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1512]. (let ((.cse2 (select v_main_a_1512 main_y))) (let ((.cse0 (= (store v_main_a_1512 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1512 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 8) (= .cse2 993))))) [2019-05-15 10:35:22,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:35:22,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:22,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,279 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:22,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1513]. (let ((.cse1 (select v_main_a_1513 main_x))) (let ((.cse0 (= (store v_main_a_1513 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 8) (= (select v_main_a_1513 main_y) 992)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:35:22,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:35:22,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,361 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:22,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,394 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:22,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1514]. (let ((.cse1 (select v_main_a_1514 main_y))) (let ((.cse0 (= (store v_main_a_1514 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1514 main_x))) (or (and .cse0 (= .cse1 992) (= .cse2 9)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:35:22,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:35:22,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:22,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,518 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:22,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1515]. (let ((.cse0 (select v_main_a_1515 main_x))) (let ((.cse1 (= main_a (store v_main_a_1515 main_x (+ .cse0 1))))) (or (and (= .cse0 9) (= (select v_main_a_1515 main_y) 991) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:35:22,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:35:22,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:22,607 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,632 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:22,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1516]. (let ((.cse0 (select v_main_a_1516 main_y))) (let ((.cse1 (select v_main_a_1516 main_x)) (.cse2 (= main_a (store v_main_a_1516 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 991) (= .cse1 10) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:35:22,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:22,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:22,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,758 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:22,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1517]. (let ((.cse0 (select v_main_a_1517 main_x))) (let ((.cse1 (= (store v_main_a_1517 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 10 .cse0) (= 990 (select v_main_a_1517 main_y)))))) [2019-05-15 10:35:22,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:35:22,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:22,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,873 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,874 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:22,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1518]. (let ((.cse2 (select v_main_a_1518 main_y))) (let ((.cse0 (= (store v_main_a_1518 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1518 main_x))) (or (and .cse0 (= 11 .cse1) (= 990 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:35:22,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:35:22,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:22,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:22,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:22,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,990 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:22,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:22,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:23,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1519]. (let ((.cse0 (select v_main_a_1519 main_x))) (let ((.cse1 (= (store v_main_a_1519 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= (select v_main_a_1519 main_y) 989) (= 11 .cse0))))) [2019-05-15 10:35:23,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:35:23,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:23,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:23,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:23,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,111 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:23,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:23,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:23,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1520]. (let ((.cse0 (select v_main_a_1520 main_y))) (let ((.cse1 (= (store v_main_a_1520 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1520 main_x))) (or (and (= .cse0 989) .cse1 (= .cse2 12)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:35:23,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:23,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:23,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:23,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:23,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,282 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:23,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:23,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:23,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1521]. (let ((.cse0 (select v_main_a_1521 main_x))) (let ((.cse1 (= (store v_main_a_1521 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 12) (= (select v_main_a_1521 main_y) 988) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:35:23,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:35:23,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:23,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:23,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:23,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,416 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:23,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:23,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:23,467 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1522]. (let ((.cse0 (select v_main_a_1522 main_y))) (let ((.cse1 (= main_a (store v_main_a_1522 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_1522 main_x))) (or (and (= .cse0 988) .cse1 (= .cse2 13)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:35:23,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:23,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:23,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:23,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:23,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,581 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:23,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:23,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:23,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1523]. (let ((.cse0 (select v_main_a_1523 main_x))) (let ((.cse1 (= (store v_main_a_1523 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 13) .cse1 (= (select v_main_a_1523 main_y) 987)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:35:23,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:35:23,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:23,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:23,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:23,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:23,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,717 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:23,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:23,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:23,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1524]. (let ((.cse2 (select v_main_a_1524 main_y))) (let ((.cse1 (= (store v_main_a_1524 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1524 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 987) (= .cse0 14))))) [2019-05-15 10:35:23,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:35:23,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:23,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:23,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:23,837 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,862 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:23,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:23,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:23,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1525]. (let ((.cse0 (select v_main_a_1525 main_x))) (let ((.cse1 (= (store v_main_a_1525 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1525 main_y) 986) (= .cse0 14) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:35:23,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:35:23,940 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:23,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:23,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:23,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:23,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,990 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:23,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:23,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:24,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1526]. (let ((.cse2 (select v_main_a_1526 main_y))) (let ((.cse0 (select v_main_a_1526 main_x)) (.cse1 (= (store v_main_a_1526 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 15) (= .cse2 986) .cse1)))) [2019-05-15 10:35:24,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:24,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:24,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:24,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:24,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,191 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:24,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:24,191 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:24,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,203 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1527]. (let ((.cse1 (select v_main_a_1527 main_x))) (let ((.cse0 (= main_a (store v_main_a_1527 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_1527 main_y) 985) .cse0 (= 15 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:35:24,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:35:24,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:24,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:24,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:24,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:24,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,326 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:24,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:24,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:24,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1528]. (let ((.cse2 (select v_main_a_1528 main_y))) (let ((.cse0 (= (store v_main_a_1528 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1528 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 16) (= 985 .cse2))))) [2019-05-15 10:35:24,364 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:24,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:24,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:24,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:24,449 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,472 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:24,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:24,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:24,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1529]. (let ((.cse1 (select v_main_a_1529 main_x))) (let ((.cse0 (= (store v_main_a_1529 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1529 main_y) 984) (= .cse1 16)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:35:24,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:35:24,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:24,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:24,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:24,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:24,573 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,597 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:24,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:24,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:24,608 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1530]. (let ((.cse2 (select v_main_a_1530 main_y))) (let ((.cse0 (= main_a (store v_main_a_1530 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1530 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 17 .cse1) (= .cse2 984))))) [2019-05-15 10:35:24,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:35:24,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:24,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:24,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:24,697 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,722 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:24,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:24,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:24,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1531]. (let ((.cse1 (select v_main_a_1531 main_x))) (let ((.cse0 (= (store v_main_a_1531 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1531 main_y) 983) (= .cse1 17)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:24,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:35:24,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:24,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:24,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:24,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,864 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:24,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:24,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:24,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1532]. (let ((.cse2 (select v_main_a_1532 main_y))) (let ((.cse0 (select v_main_a_1532 main_x)) (.cse1 (= (store v_main_a_1532 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 18) .cse1 (= 983 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:35:24,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:25,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:25,022 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:25,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:25,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,053 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:25,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:25,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:25,066 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,066 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1533]. (let ((.cse1 (select v_main_a_1533 main_x))) (let ((.cse0 (= (store v_main_a_1533 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1533 main_y) 982) .cse0 (= .cse1 18)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:25,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:35:25,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:25,154 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:25,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:25,161 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,185 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:25,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:25,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:25,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1534]. (let ((.cse2 (select v_main_a_1534 main_y))) (let ((.cse0 (= (store v_main_a_1534 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1534 main_x))) (or (and .cse0 (= .cse1 19) (= .cse2 982)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:35:25,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:35:25,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:25,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:25,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:25,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,315 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:25,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:25,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:25,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1535]. (let ((.cse0 (select v_main_a_1535 main_x))) (let ((.cse1 (= (store v_main_a_1535 main_x (+ .cse0 1)) main_a))) (or (and (= 981 (select v_main_a_1535 main_y)) (= 19 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:35:25,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:35:25,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:25,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:25,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:25,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:25,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,461 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:25,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:25,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:25,519 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1536]. (let ((.cse2 (select v_main_a_1536 main_y))) (let ((.cse0 (select v_main_a_1536 main_x)) (.cse1 (= (store v_main_a_1536 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 981 .cse2) (= 20 .cse0) .cse1)))) [2019-05-15 10:35:25,520 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:25,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:25,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:25,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:25,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,642 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:25,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:25,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:25,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1537]. (let ((.cse0 (select v_main_a_1537 main_x))) (let ((.cse1 (= (store v_main_a_1537 main_x (+ .cse0 1)) main_a))) (or (and (= 20 .cse0) (= 980 (select v_main_a_1537 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:35:25,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:35:25,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:25,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:25,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:25,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,783 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:25,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:25,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:25,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1538]. (let ((.cse1 (select v_main_a_1538 main_y))) (let ((.cse0 (select v_main_a_1538 main_x)) (.cse2 (= (store v_main_a_1538 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 21) (= .cse1 980) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:35:25,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:25,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:25,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:25,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:25,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,956 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:25,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:25,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:25,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1539]. (let ((.cse0 (select v_main_a_1539 main_x))) (let ((.cse1 (= (store v_main_a_1539 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 21) .cse1 (= (select v_main_a_1539 main_y) 979)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:35:25,968 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:35:26,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:26,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:26,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:26,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:26,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,108 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:26,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:26,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:26,118 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:26,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1540]. (let ((.cse2 (select v_main_a_1540 main_y))) (let ((.cse0 (= main_a (store v_main_a_1540 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1540 main_x))) (or (and .cse0 (= .cse1 22) (= .cse2 979)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:35:26,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:35:26,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:26,216 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:26,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:26,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:26,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,248 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:26,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:26,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:26,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:26,261 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1541]. (let ((.cse1 (select v_main_a_1541 main_x))) (let ((.cse0 (= (store v_main_a_1541 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1541 main_y) 978) .cse0 (= .cse1 22)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:26,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:35:26,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:26,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:26,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:26,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:26,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,402 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:26,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:26,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:26,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:26,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1542]. (let ((.cse0 (select v_main_a_1542 main_y))) (let ((.cse2 (select v_main_a_1542 main_x)) (.cse1 (= (store v_main_a_1542 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 978 .cse0) .cse1 (= .cse2 23)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:35:26,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:26,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:26,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:26,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:26,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:26,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,607 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:26,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:26,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:26,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:26,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1543]. (let ((.cse1 (select v_main_a_1543 main_x))) (let ((.cse0 (= main_a (store v_main_a_1543 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= 977 (select v_main_a_1543 main_y)) (= .cse1 23))))) [2019-05-15 10:35:26,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:35:26,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:26,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:26,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:26,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,729 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:26,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:26,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,756 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:26,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:26,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:26,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:26,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1544]. (let ((.cse2 (select v_main_a_1544 main_y))) (let ((.cse0 (select v_main_a_1544 main_x)) (.cse1 (= (store v_main_a_1544 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 24) (= .cse2 977) .cse1)))) [2019-05-15 10:35:26,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:26,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:26,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:26,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:26,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:26,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:26,963 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:26,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:26,964 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:26,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:26,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1545]. (let ((.cse1 (select v_main_a_1545 main_x))) (let ((.cse0 (= (store v_main_a_1545 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= .cse1 24) (= (select v_main_a_1545 main_y) 976))))) [2019-05-15 10:35:26,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:35:27,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:27,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:27,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:27,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:27,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:27,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,111 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:27,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:27,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:27,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:27,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1546]. (let ((.cse2 (select v_main_a_1546 main_y))) (let ((.cse0 (select v_main_a_1546 main_x)) (.cse1 (= (store v_main_a_1546 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 25) (= .cse2 976) .cse1)))) [2019-05-15 10:35:27,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:27,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:27,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:27,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,304 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:27,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:27,306 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,331 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:27,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:27,331 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:27,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:27,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1547]. (let ((.cse0 (select v_main_a_1547 main_x))) (let ((.cse1 (= (store v_main_a_1547 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= 975 (select v_main_a_1547 main_y)) (= .cse0 25))))) [2019-05-15 10:35:27,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:35:27,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:27,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:27,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:27,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:27,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,482 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:27,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:27,483 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:27,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:27,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1548]. (let ((.cse0 (select v_main_a_1548 main_y))) (let ((.cse1 (select v_main_a_1548 main_x)) (.cse2 (= (store v_main_a_1548 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 975 .cse0) (= 26 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:35:27,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:27,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:27,651 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:27,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:27,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:27,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,684 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:27,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:27,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:27,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:27,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1549]. (let ((.cse1 (select v_main_a_1549 main_x))) (let ((.cse0 (= main_a (store v_main_a_1549 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_1549 main_y) 974) .cse0 (= .cse1 26)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:27,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:35:27,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:27,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:27,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:27,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:27,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,840 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:27,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:27,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:27,865 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:27,865 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1550]. (let ((.cse2 (select v_main_a_1550 main_y))) (let ((.cse1 (= (store v_main_a_1550 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1550 main_x))) (or (and (= .cse0 27) .cse1 (= .cse2 974)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:35:27,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:27,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:27,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:27,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:27,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:27,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:27,981 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,006 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:28,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:28,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:28,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:28,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1551]. (let ((.cse0 (select v_main_a_1551 main_x))) (let ((.cse1 (= (store v_main_a_1551 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1551 main_y) 973) (= .cse0 27) .cse1)))) [2019-05-15 10:35:28,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:35:28,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:28,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:28,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:28,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:28,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,169 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:28,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:28,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:28,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:28,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1552]. (let ((.cse1 (select v_main_a_1552 main_y))) (let ((.cse0 (= (store v_main_a_1552 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1552 main_x))) (or (and .cse0 (= 973 .cse1) (= 28 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:35:28,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:28,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:28,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:28,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:28,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:28,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,395 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:28,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:28,396 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:28,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:28,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1553]. (let ((.cse1 (select v_main_a_1553 main_x))) (let ((.cse0 (= (store v_main_a_1553 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 28 .cse1) (= (select v_main_a_1553 main_y) 972))))) [2019-05-15 10:35:28,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:35:28,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:28,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:28,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:28,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:28,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,557 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:28,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:28,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:28,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:28,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1554]. (let ((.cse1 (select v_main_a_1554 main_y))) (let ((.cse0 (= main_a (store v_main_a_1554 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_1554 main_x))) (or (and .cse0 (= .cse1 972) (= .cse2 29)) (and .cse0 (= main_y main_x) (= .cse2 1001))))) [2019-05-15 10:35:28,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:28,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:28,758 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:28,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:28,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:28,766 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,791 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:28,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:28,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:28,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:28,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1555]. (let ((.cse1 (select v_main_a_1555 main_x))) (let ((.cse0 (= (store v_main_a_1555 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 29 .cse1) (= 971 (select v_main_a_1555 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:35:28,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:35:28,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:28,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:28,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:28,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:28,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:28,967 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:28,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:28,968 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:29,040 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:29,040 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1556]. (let ((.cse0 (select v_main_a_1556 main_y))) (let ((.cse1 (= main_a (store v_main_a_1556 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_1556 main_x))) (or (and (= .cse0 971) .cse1 (= .cse2 30)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:35:29,041 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:29,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:29,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:29,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:29,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:29,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,202 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:29,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:29,202 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:29,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:29,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1557]. (let ((.cse1 (select v_main_a_1557 main_x))) (let ((.cse0 (= (store v_main_a_1557 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1557 main_y) 970) .cse0 (= 30 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:35:29,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:35:29,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:29,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:29,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:29,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:29,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,383 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:29,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:29,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:29,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:29,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1558]. (let ((.cse1 (select v_main_a_1558 main_y))) (let ((.cse2 (= (store v_main_a_1558 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1558 main_x))) (or (and (= .cse0 31) (= .cse1 970) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:35:29,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:29,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:29,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:29,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:29,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:29,573 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,609 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:29,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:29,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:29,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:29,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1559]. (let ((.cse1 (select v_main_a_1559 main_x))) (let ((.cse0 (= main_a (store v_main_a_1559 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 31) (= (select v_main_a_1559 main_y) 969)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:29,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:35:29,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:29,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:29,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:29,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:29,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:29,753 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,778 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:29,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:29,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:29,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:29,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1560]. (let ((.cse2 (select v_main_a_1560 main_y))) (let ((.cse1 (= (store v_main_a_1560 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1560 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 969) (= .cse0 32))))) [2019-05-15 10:35:29,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:29,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:29,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:29,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,950 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:29,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:29,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:29,988 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:29,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:29,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:30,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:30,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1561]. (let ((.cse0 (select v_main_a_1561 main_x))) (let ((.cse1 (= (store v_main_a_1561 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1561 main_y) 968) (= .cse0 32) .cse1)))) [2019-05-15 10:35:30,000 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:35:30,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:30,126 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:30,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:30,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:30,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,162 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:30,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:30,162 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:30,189 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:30,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1562]. (let ((.cse0 (select v_main_a_1562 main_y))) (let ((.cse1 (select v_main_a_1562 main_x)) (.cse2 (= (store v_main_a_1562 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 968) (= .cse1 33) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:35:30,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:30,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:30,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:30,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:30,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:30,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,373 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:30,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:30,374 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:30,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:30,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1563]. (let ((.cse1 (select v_main_a_1563 main_x))) (let ((.cse0 (= (store v_main_a_1563 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 33) (= (select v_main_a_1563 main_y) 967)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:35:30,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:35:30,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:30,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:30,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:30,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,505 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:30,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:30,507 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,541 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:30,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:30,541 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:30,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:30,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1564]. (let ((.cse2 (select v_main_a_1564 main_y))) (let ((.cse0 (= main_a (store v_main_a_1564 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1564 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 967) .cse0 (= .cse1 34))))) [2019-05-15 10:35:30,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:30,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:30,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:30,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,750 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:30,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:30,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,776 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:30,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:30,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:30,784 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:30,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1565]. (let ((.cse1 (select v_main_a_1565 main_x))) (let ((.cse0 (= (store v_main_a_1565 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 966 (select v_main_a_1565 main_y)) (= 34 .cse1))))) [2019-05-15 10:35:30,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:35:30,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:30,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:30,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:30,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:30,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:30,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:30,934 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:30,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:30,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:30,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:30,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1566]. (let ((.cse2 (select v_main_a_1566 main_y))) (let ((.cse0 (select v_main_a_1566 main_x)) (.cse1 (= (store v_main_a_1566 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 35) (= .cse2 966) .cse1)))) [2019-05-15 10:35:30,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:35:31,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:31,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:31,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:31,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:31,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,100 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:31,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:31,100 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:31,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:31,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1567]. (let ((.cse0 (select v_main_a_1567 main_x))) (let ((.cse1 (= main_a (store v_main_a_1567 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 35) .cse1 (= 965 (select v_main_a_1567 main_y)))))) [2019-05-15 10:35:31,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:35:31,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:31,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:31,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:31,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:31,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:31,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,266 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:31,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:31,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:31,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:31,276 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1568]. (let ((.cse2 (select v_main_a_1568 main_y))) (let ((.cse0 (select v_main_a_1568 main_x)) (.cse1 (= (store v_main_a_1568 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 965) (= .cse0 36) .cse1)))) [2019-05-15 10:35:31,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:35:31,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:31,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:31,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:31,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:31,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,435 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:31,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:31,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:31,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:31,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1569]. (let ((.cse0 (select v_main_a_1569 main_x))) (let ((.cse1 (= (store v_main_a_1569 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1569 main_y) 964) (= 36 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:35:31,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:35:31,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:31,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:31,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:31,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:31,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,606 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:31,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:31,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:31,710 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:31,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1570]. (let ((.cse1 (select v_main_a_1570 main_y))) (let ((.cse0 (= (store v_main_a_1570 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1570 main_x))) (or (and .cse0 (= .cse1 964) (= .cse2 37)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:35:31,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:31,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:31,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:31,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:31,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:31,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:31,884 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:31,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:31,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:31,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:31,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1571]. (let ((.cse1 (select v_main_a_1571 main_x))) (let ((.cse0 (= (store v_main_a_1571 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1571 main_y) 963) (= .cse1 37))))) [2019-05-15 10:35:31,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:35:32,010 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:32,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:32,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:32,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:32,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:32,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:32,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:32,058 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:32,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:32,058 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:32,070 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:32,070 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1572]. (let ((.cse2 (select v_main_a_1572 main_y))) (let ((.cse0 (select v_main_a_1572 main_x)) (.cse1 (= main_a (store v_main_a_1572 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 38) (= .cse2 963) .cse1)))) [2019-05-15 10:35:32,070 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:35:32,183 INFO L273 TraceCheckUtils]: 0: Hoare triple {12897#true} a := a[x := 0]; {12902#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:35:32,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {12902#(= (select main_a main_x) 0)} a := a[y := 1000]; {12906#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:35:32,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {12906#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {12910#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:35:32,186 INFO L273 TraceCheckUtils]: 3: Hoare triple {12910#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {12914#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,188 INFO L273 TraceCheckUtils]: 4: Hoare triple {12914#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12918#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:35:32,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {12918#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {12922#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {12922#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12926#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:35:32,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {12926#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {12930#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {12930#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12934#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:35:32,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {12934#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {12938#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,195 INFO L273 TraceCheckUtils]: 10: Hoare triple {12938#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12942#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:35:32,196 INFO L273 TraceCheckUtils]: 11: Hoare triple {12942#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {12946#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,197 INFO L273 TraceCheckUtils]: 12: Hoare triple {12946#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12950#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:35:32,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {12950#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {12954#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:35:32,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {12954#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {12958#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:35:32,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {12958#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {12962#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:35:32,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {12962#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {12966#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:35:32,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {12966#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {12970#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:35:32,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {12970#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {12974#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:35:32,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {12974#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {12978#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {12978#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12982#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:35:32,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {12982#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {12986#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {12986#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {12990#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:35:32,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {12990#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {12994#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:35:32,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {12994#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {12998#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:35:32,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {12998#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {13002#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {13002#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13006#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:35:32,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {13006#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {13010#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {13010#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13014#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:35:32,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {13014#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {13018#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:35:32,218 INFO L273 TraceCheckUtils]: 30: Hoare triple {13018#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {13022#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:35:32,219 INFO L273 TraceCheckUtils]: 31: Hoare triple {13022#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {13026#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,220 INFO L273 TraceCheckUtils]: 32: Hoare triple {13026#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13030#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:35:32,221 INFO L273 TraceCheckUtils]: 33: Hoare triple {13030#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {13034#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,222 INFO L273 TraceCheckUtils]: 34: Hoare triple {13034#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13038#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:35:32,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {13038#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {13042#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:35:32,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {13042#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {13046#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:35:32,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {13046#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {13050#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {13050#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13054#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:35:32,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {13054#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {13058#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:35:32,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {13058#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {13062#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:35:32,230 INFO L273 TraceCheckUtils]: 41: Hoare triple {13062#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {13066#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,232 INFO L273 TraceCheckUtils]: 42: Hoare triple {13066#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13070#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:35:32,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {13070#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {13074#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {13074#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13078#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:35:32,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {13078#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {13082#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:35:32,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {13082#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {13086#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:35:32,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {13086#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {13090#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {13090#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13094#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:35:32,239 INFO L273 TraceCheckUtils]: 49: Hoare triple {13094#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {13098#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,241 INFO L273 TraceCheckUtils]: 50: Hoare triple {13098#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13102#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:35:32,242 INFO L273 TraceCheckUtils]: 51: Hoare triple {13102#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {13106#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,243 INFO L273 TraceCheckUtils]: 52: Hoare triple {13106#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13110#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:35:32,244 INFO L273 TraceCheckUtils]: 53: Hoare triple {13110#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {13114#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,245 INFO L273 TraceCheckUtils]: 54: Hoare triple {13114#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13118#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:35:32,246 INFO L273 TraceCheckUtils]: 55: Hoare triple {13118#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {13122#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,247 INFO L273 TraceCheckUtils]: 56: Hoare triple {13122#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13126#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:35:32,248 INFO L273 TraceCheckUtils]: 57: Hoare triple {13126#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {13130#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {13130#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13134#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:35:32,251 INFO L273 TraceCheckUtils]: 59: Hoare triple {13134#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {13138#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,252 INFO L273 TraceCheckUtils]: 60: Hoare triple {13138#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13142#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:35:32,253 INFO L273 TraceCheckUtils]: 61: Hoare triple {13142#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {13146#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,254 INFO L273 TraceCheckUtils]: 62: Hoare triple {13146#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13150#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:35:32,255 INFO L273 TraceCheckUtils]: 63: Hoare triple {13150#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {13154#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {13154#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13158#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:35:32,258 INFO L273 TraceCheckUtils]: 65: Hoare triple {13158#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {13162#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,259 INFO L273 TraceCheckUtils]: 66: Hoare triple {13162#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13166#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:35:32,260 INFO L273 TraceCheckUtils]: 67: Hoare triple {13166#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {13170#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,261 INFO L273 TraceCheckUtils]: 68: Hoare triple {13170#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13174#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:35:32,262 INFO L273 TraceCheckUtils]: 69: Hoare triple {13174#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {13178#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:35:32,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {13178#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {13182#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:35:32,265 INFO L273 TraceCheckUtils]: 71: Hoare triple {13182#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {13186#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:35:32,266 INFO L273 TraceCheckUtils]: 72: Hoare triple {13186#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {13190#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:35:32,267 INFO L273 TraceCheckUtils]: 73: Hoare triple {13190#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {13194#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:35:32,268 INFO L273 TraceCheckUtils]: 74: Hoare triple {13194#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {13198#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:35:32,269 INFO L273 TraceCheckUtils]: 75: Hoare triple {13198#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {13202#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:35:32,270 INFO L273 TraceCheckUtils]: 76: Hoare triple {13202#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13206#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:35:32,271 INFO L273 TraceCheckUtils]: 77: Hoare triple {13206#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {13210#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:35:32,272 INFO L273 TraceCheckUtils]: 78: Hoare triple {13210#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} assume x > y && a[x] == 1000; {12898#false} is VALID [2019-05-15 10:35:32,272 INFO L273 TraceCheckUtils]: 79: Hoare triple {12898#false} assume !(a[y] <= 0); {12898#false} is VALID [2019-05-15 10:35:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:32,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:32,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-15 10:35:32,297 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-05-15 10:35:32,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:32,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states. [2019-05-15 10:35:32,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:32,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-05-15 10:35:32,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-15 10:35:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-05-15 10:35:32,401 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-05-15 10:35:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:48,329 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:35:48,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-15 10:35:48,329 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-05-15 10:35:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-05-15 10:35:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-05-15 10:35:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-05-15 10:35:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-05-15 10:35:48,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2019-05-15 10:35:48,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:48,440 INFO L225 Difference]: With dead ends: 83 [2019-05-15 10:35:48,440 INFO L226 Difference]: Without dead ends: 83 [2019-05-15 10:35:48,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-05-15 10:35:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-05-15 10:35:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-05-15 10:35:48,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:48,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2019-05-15 10:35:48,443 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2019-05-15 10:35:48,444 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2019-05-15 10:35:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:48,445 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:35:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:35:48,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:48,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:48,445 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2019-05-15 10:35:48,445 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2019-05-15 10:35:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:48,446 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:35:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:35:48,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:48,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:48,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:48,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-05-15 10:35:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-05-15 10:35:48,448 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-05-15 10:35:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:48,448 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-05-15 10:35:48,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-05-15 10:35:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:35:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-05-15 10:35:48,449 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:48,449 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-05-15 10:35:48,449 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:48,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1856612726, now seen corresponding path program 39 times [2019-05-15 10:35:48,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:48,574 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-15 10:35:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:48,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:48,607 INFO L375 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 6 treesize of output 5 [2019-05-15 10:35:48,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:48,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:48,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:48,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1573]. (= (store v_main_a_1573 main_x 0) main_a) [2019-05-15 10:35:48,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:35:48,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:48,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:35:48,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,660 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:35:48,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:35:48,665 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:48,665 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1574]. (and (= 0 (select v_main_a_1574 main_x)) (= (store v_main_a_1574 main_y 1000) main_a)) [2019-05-15 10:35:48,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:35:48,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:48,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:48,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:48,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:48,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:48,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,739 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:48,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:48,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:48,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:48,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1575]. (let ((.cse2 (select v_main_a_1575 main_x))) (let ((.cse0 (= (select v_main_a_1575 main_y) 1000)) (.cse1 (= (store v_main_a_1575 main_x (+ .cse2 1)) main_a))) (or (and (= main_y main_x) .cse0 .cse1) (and (= .cse2 0) .cse0 .cse1)))) [2019-05-15 10:35:48,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:35:48,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:48,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:48,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:48,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:48,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,831 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:48,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:48,831 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:48,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:48,865 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1576]. (let ((.cse1 (select v_main_a_1576 main_y))) (let ((.cse2 (= (store v_main_a_1576 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1576 main_x))) (or (and (= .cse0 1) (= .cse1 1000) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:35:48,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:48,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:48,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:48,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:48,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:48,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:48,950 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:48,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:48,950 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:48,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:48,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1577]. (let ((.cse1 (select v_main_a_1577 main_x))) (let ((.cse0 (= (store v_main_a_1577 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 1) (= (select v_main_a_1577 main_y) 999))))) [2019-05-15 10:35:48,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:35:49,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:49,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,058 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:49,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:49,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:49,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1578]. (let ((.cse1 (select v_main_a_1578 main_y))) (let ((.cse0 (= (store v_main_a_1578 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1578 main_x))) (or (and .cse0 (= .cse1 999) (= 2 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:35:49,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:49,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:49,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,189 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:49,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:49,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:49,201 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1579]. (let ((.cse1 (select v_main_a_1579 main_x))) (let ((.cse0 (= (store v_main_a_1579 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 2) (= (select v_main_a_1579 main_y) 998)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:49,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:35:49,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,257 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:49,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,288 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:49,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:49,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:49,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,344 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1580]. (let ((.cse2 (select v_main_a_1580 main_y))) (let ((.cse0 (= (store v_main_a_1580 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1580 main_x))) (or (and .cse0 (= 3 .cse1) (= .cse2 998)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:35:49,344 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:49,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:49,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,429 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:49,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:49,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:49,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1581]. (let ((.cse0 (select v_main_a_1581 main_x))) (let ((.cse1 (= (store v_main_a_1581 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1581 main_y) 997) (= .cse0 3) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:35:49,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:35:49,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:49,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,527 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:49,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:49,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:49,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1582]. (let ((.cse0 (select v_main_a_1582 main_y))) (let ((.cse2 (select v_main_a_1582 main_x)) (.cse1 (= main_a (store v_main_a_1582 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 997) .cse1 (= .cse2 4)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:35:49,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:49,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:49,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,664 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:49,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:49,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:49,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1583]. (let ((.cse0 (select v_main_a_1583 main_x))) (let ((.cse1 (= (store v_main_a_1583 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 4) (= (select v_main_a_1583 main_y) 996) .cse1)))) [2019-05-15 10:35:49,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:35:49,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:49,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,772 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:49,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:49,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:49,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1584]. (let ((.cse1 (select v_main_a_1584 main_y))) (let ((.cse0 (= (store v_main_a_1584 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1584 main_x))) (or (and .cse0 (= .cse1 996) (= .cse2 5)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:35:49,789 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:49,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:49,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,881 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:49,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:49,882 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:49,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1585]. (let ((.cse1 (select v_main_a_1585 main_x))) (let ((.cse0 (= main_a (store v_main_a_1585 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 5) (= (select v_main_a_1585 main_y) 995)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:35:49,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:35:49,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:49,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:49,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:49,967 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,003 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:50,054 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1586]. (let ((.cse1 (select v_main_a_1586 main_y))) (let ((.cse0 (= (store v_main_a_1586 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1586 main_x))) (or (and .cse0 (= .cse1 995) (= .cse2 6)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:35:50,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:50,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:50,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:50,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:50,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,151 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:50,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1587]. (let ((.cse1 (select v_main_a_1587 main_x))) (let ((.cse0 (= main_a (store v_main_a_1587 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 6) (= (select v_main_a_1587 main_y) 994)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:50,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:35:50,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:50,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:50,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:50,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,261 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:50,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1588]. (let ((.cse0 (select v_main_a_1588 main_y))) (let ((.cse1 (select v_main_a_1588 main_x)) (.cse2 (= main_a (store v_main_a_1588 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 994) (= .cse1 7) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:35:50,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:35:50,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:50,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:50,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:50,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,371 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:50,380 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,380 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1589]. (let ((.cse1 (select v_main_a_1589 main_x))) (let ((.cse0 (= (store v_main_a_1589 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 993 (select v_main_a_1589 main_y)) (= .cse1 7)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:50,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:35:50,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:50,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:50,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:50,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,478 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,479 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:50,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1590]. (let ((.cse2 (select v_main_a_1590 main_y))) (let ((.cse0 (= main_a (store v_main_a_1590 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1590 main_x))) (or (and .cse0 (= .cse1 8) (= .cse2 993)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:35:50,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:50,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:50,576 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:50,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:50,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,609 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:50,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1591]. (let ((.cse1 (select v_main_a_1591 main_x))) (let ((.cse0 (= (store v_main_a_1591 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1591 main_y) 992) .cse0 (= .cse1 8)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:35:50,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:35:50,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:50,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:50,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:50,702 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,728 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,729 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:50,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1592]. (let ((.cse1 (select v_main_a_1592 main_y))) (let ((.cse0 (= main_a (store v_main_a_1592 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_1592 main_x))) (or (and .cse0 (= .cse1 992) (= .cse2 9)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:35:50,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:35:50,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:50,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:50,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:50,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,855 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,856 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:50,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1593]. (let ((.cse1 (select v_main_a_1593 main_x))) (let ((.cse0 (= (store v_main_a_1593 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 991 (select v_main_a_1593 main_y)) (= 9 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:35:50,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:35:50,924 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:50,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:50,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:50,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:50,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,977 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:50,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:50,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:51,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1594]. (let ((.cse2 (select v_main_a_1594 main_y))) (let ((.cse0 (= (store v_main_a_1594 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1594 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 991) (= .cse1 10))))) [2019-05-15 10:35:51,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:51,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:51,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:51,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:51,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,113 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:51,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:51,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:51,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,125 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1595]. (let ((.cse0 (select v_main_a_1595 main_x))) (let ((.cse1 (= (store v_main_a_1595 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 10) (= (select v_main_a_1595 main_y) 990))))) [2019-05-15 10:35:51,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:35:51,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:51,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:51,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:51,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,238 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:51,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:51,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:51,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,249 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1596]. (let ((.cse2 (select v_main_a_1596 main_y))) (let ((.cse0 (select v_main_a_1596 main_x)) (.cse1 (= (store v_main_a_1596 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 11) .cse1 (= .cse2 990)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:35:51,249 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:35:51,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:51,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:51,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:51,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,356 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:51,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:51,357 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:51,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1597]. (let ((.cse0 (select v_main_a_1597 main_x))) (let ((.cse1 (= (store v_main_a_1597 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 11) (= (select v_main_a_1597 main_y) 989) .cse1)))) [2019-05-15 10:35:51,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:35:51,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:51,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:51,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:51,465 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,506 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:51,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:51,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:51,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1598]. (let ((.cse1 (select v_main_a_1598 main_y))) (let ((.cse2 (= (store v_main_a_1598 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1598 main_x))) (or (and (= .cse0 12) (= .cse1 989) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:35:51,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:51,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:51,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:51,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:51,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,657 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:51,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:51,657 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:51,670 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,670 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1599]. (let ((.cse1 (select v_main_a_1599 main_x))) (let ((.cse0 (= (store v_main_a_1599 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 12 .cse1) (= (select v_main_a_1599 main_y) 988))))) [2019-05-15 10:35:51,670 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:35:51,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:51,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:51,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:51,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,788 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:51,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:51,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:51,807 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,807 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1600]. (let ((.cse0 (select v_main_a_1600 main_y))) (let ((.cse1 (select v_main_a_1600 main_x)) (.cse2 (= main_a (store v_main_a_1600 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 988) (= .cse1 13) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:35:51,807 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:51,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:51,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:51,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:51,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,914 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:51,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:51,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:51,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1601]. (let ((.cse1 (select v_main_a_1601 main_x))) (let ((.cse0 (= (store v_main_a_1601 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 13) .cse0 (= 987 (select v_main_a_1601 main_y)))))) [2019-05-15 10:35:51,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:35:51,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:51,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:51,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:51,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,007 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:52,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,045 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:52,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:52,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:52,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1602]. (let ((.cse2 (select v_main_a_1602 main_y))) (let ((.cse0 (= main_a (store v_main_a_1602 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1602 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 987) .cse0 (= .cse1 14))))) [2019-05-15 10:35:52,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:35:52,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:52,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:52,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:52,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,164 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:52,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:52,164 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:52,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1603]. (let ((.cse1 (select v_main_a_1603 main_x))) (let ((.cse0 (= main_a (store v_main_a_1603 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1603 main_y) 986) .cse0 (= .cse1 14))))) [2019-05-15 10:35:52,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:35:52,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:52,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:52,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:52,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,297 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:52,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:52,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:52,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1604]. (let ((.cse2 (select v_main_a_1604 main_y))) (let ((.cse0 (= (store v_main_a_1604 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1604 main_x))) (or (and .cse0 (= .cse1 15) (= .cse2 986)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:35:52,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:52,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:52,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:52,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:52,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,480 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:52,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:52,481 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:52,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1605]. (let ((.cse0 (select v_main_a_1605 main_x))) (let ((.cse1 (= (store v_main_a_1605 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1605 main_y) 985) (= .cse0 15) .cse1)))) [2019-05-15 10:35:52,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:35:52,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:52,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:52,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:52,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,655 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:52,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:52,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:52,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1606]. (let ((.cse2 (select v_main_a_1606 main_y))) (let ((.cse0 (= (store v_main_a_1606 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1606 main_x))) (or (and .cse0 (= .cse1 16) (= .cse2 985)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:35:52,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:52,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:52,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:52,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:52,787 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,813 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:52,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:52,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:52,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1607]. (let ((.cse1 (select v_main_a_1607 main_x))) (let ((.cse0 (= (store v_main_a_1607 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 984 (select v_main_a_1607 main_y)) (= 16 .cse1))))) [2019-05-15 10:35:52,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:35:52,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:52,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:52,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:52,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:52,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,942 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:52,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:52,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:52,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1608]. (let ((.cse2 (select v_main_a_1608 main_y))) (let ((.cse0 (= (store v_main_a_1608 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1608 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= 984 .cse2) (= .cse1 17))))) [2019-05-15 10:35:52,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:35:53,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:53,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:53,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:53,045 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,070 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:53,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:53,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:53,081 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,082 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1609]. (let ((.cse0 (select v_main_a_1609 main_x))) (let ((.cse1 (= (store v_main_a_1609 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1609 main_y) 983) (= .cse0 17) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:35:53,082 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:35:53,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:53,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:53,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:53,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:53,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,215 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:53,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:53,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:53,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1610]. (let ((.cse2 (select v_main_a_1610 main_y))) (let ((.cse1 (= (store v_main_a_1610 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1610 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 983) .cse1 (= .cse0 18))))) [2019-05-15 10:35:53,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:53,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:53,347 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:53,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:53,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,380 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:53,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:53,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:53,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1611]. (let ((.cse1 (select v_main_a_1611 main_x))) (let ((.cse0 (= main_a (store v_main_a_1611 main_x (+ .cse1 1))))) (or (and (= 982 (select v_main_a_1611 main_y)) .cse0 (= .cse1 18)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:35:53,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:35:53,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:53,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:53,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:53,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:53,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,516 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:53,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:53,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:53,527 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1612]. (let ((.cse2 (select v_main_a_1612 main_y))) (let ((.cse0 (select v_main_a_1612 main_x)) (.cse1 (= (store v_main_a_1612 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 19) (= .cse2 982) .cse1)))) [2019-05-15 10:35:53,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:35:53,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:53,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:53,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:53,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,654 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:53,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:53,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:53,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,667 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1613]. (let ((.cse0 (select v_main_a_1613 main_x))) (let ((.cse1 (= (store v_main_a_1613 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 19) .cse1 (= (select v_main_a_1613 main_y) 981)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:35:53,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:35:53,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:53,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:53,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:53,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:53,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,804 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:53,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:53,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:53,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1614]. (let ((.cse2 (select v_main_a_1614 main_y))) (let ((.cse1 (= (store v_main_a_1614 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1614 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 981) .cse1 (= .cse0 20))))) [2019-05-15 10:35:53,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:53,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:53,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:53,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:53,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,989 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:53,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:53,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:54,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1615]. (let ((.cse1 (select v_main_a_1615 main_x))) (let ((.cse0 (= (store v_main_a_1615 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= 980 (select v_main_a_1615 main_y)) (= .cse1 20))))) [2019-05-15 10:35:54,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:35:54,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:54,094 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:54,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:54,103 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,127 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:54,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:54,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:54,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1616]. (let ((.cse0 (select v_main_a_1616 main_y))) (let ((.cse1 (select v_main_a_1616 main_x)) (.cse2 (= (store v_main_a_1616 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 980) (= .cse1 21) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:35:54,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:54,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:54,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:54,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:54,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,289 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:54,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:54,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:54,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1617]. (let ((.cse0 (select v_main_a_1617 main_x))) (let ((.cse1 (= (store v_main_a_1617 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 21) (= (select v_main_a_1617 main_y) 979) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:35:54,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:35:54,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:54,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:54,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:54,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,432 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:54,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:54,433 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:54,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1618]. (let ((.cse0 (select v_main_a_1618 main_y))) (let ((.cse1 (= (store v_main_a_1618 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1618 main_x))) (or (and (= .cse0 979) .cse1 (= .cse2 22)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:35:54,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:35:54,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:54,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:54,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:54,552 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,576 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:54,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:54,577 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:54,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1619]. (let ((.cse1 (select v_main_a_1619 main_x))) (let ((.cse0 (= (store v_main_a_1619 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1619 main_y) 978) (= .cse1 22)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:54,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:35:54,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:54,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:54,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:54,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,729 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:54,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:54,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:54,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,790 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1620]. (let ((.cse2 (select v_main_a_1620 main_y))) (let ((.cse0 (select v_main_a_1620 main_x)) (.cse1 (= (store v_main_a_1620 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 23) .cse1 (= 978 .cse2)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:35:54,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:54,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:54,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:54,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:54,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,922 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:54,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:54,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:54,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1621]. (let ((.cse0 (select v_main_a_1621 main_x))) (let ((.cse1 (= (store v_main_a_1621 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 23 .cse0) .cse1 (= (select v_main_a_1621 main_y) 977))))) [2019-05-15 10:35:54,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:35:55,021 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:55,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:55,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:55,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:55,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,068 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:55,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:55,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:55,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,115 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1622]. (let ((.cse2 (select v_main_a_1622 main_y))) (let ((.cse1 (= main_a (store v_main_a_1622 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1622 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 977) (= .cse0 24))))) [2019-05-15 10:35:55,115 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:55,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:55,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:55,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,221 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:55,223 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,258 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:55,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:55,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:55,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1623]. (let ((.cse0 (select v_main_a_1623 main_x))) (let ((.cse1 (= (store v_main_a_1623 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 24) (= (select v_main_a_1623 main_y) 976) .cse1)))) [2019-05-15 10:35:55,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:35:55,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:55,375 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:55,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:55,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,409 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:55,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:55,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:55,462 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1624]. (let ((.cse2 (select v_main_a_1624 main_y))) (let ((.cse0 (= (store v_main_a_1624 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1624 main_x))) (or (and .cse0 (= .cse1 25) (= .cse2 976)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:35:55,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:55,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:55,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:55,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,572 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:55,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,599 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:55,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:55,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:55,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1625]. (let ((.cse0 (select v_main_a_1625 main_x))) (let ((.cse1 (= main_a (store v_main_a_1625 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1625 main_y) 975) .cse1 (= .cse0 25))))) [2019-05-15 10:35:55,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:35:55,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:55,718 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:55,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:55,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,763 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:55,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:55,763 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:55,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1626]. (let ((.cse0 (select v_main_a_1626 main_y))) (let ((.cse1 (select v_main_a_1626 main_x)) (.cse2 (= (store v_main_a_1626 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 975) (= .cse1 26) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:35:55,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:55,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:55,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:55,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:55,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,949 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:55,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:55,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:55,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1627]. (let ((.cse1 (select v_main_a_1627 main_x))) (let ((.cse0 (= (store v_main_a_1627 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1627 main_y) 974) .cse0 (= .cse1 26))))) [2019-05-15 10:35:55,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:35:56,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:56,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:56,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:56,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:56,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:56,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,103 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:56,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:56,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:56,133 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:56,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1628]. (let ((.cse2 (select v_main_a_1628 main_y))) (let ((.cse0 (select v_main_a_1628 main_x)) (.cse1 (= (store v_main_a_1628 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 27) .cse1 (= .cse2 974))))) [2019-05-15 10:35:56,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:56,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:56,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:56,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:56,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:56,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,275 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:56,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:56,276 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:56,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:56,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1629]. (let ((.cse1 (select v_main_a_1629 main_x))) (let ((.cse0 (= (store v_main_a_1629 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1629 main_y) 973) .cse0 (= .cse1 27))))) [2019-05-15 10:35:56,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:35:56,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:56,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:56,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:56,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:56,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,437 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:56,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:56,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:56,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:56,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1630]. (let ((.cse1 (select v_main_a_1630 main_y))) (let ((.cse2 (select v_main_a_1630 main_x)) (.cse0 (= (store v_main_a_1630 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= .cse1 973) (= .cse2 28)) (and (= main_y main_x) (= .cse2 1001) .cse0)))) [2019-05-15 10:35:56,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:56,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:56,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:56,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:56,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:56,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,643 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:56,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:56,644 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:56,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:56,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1631]. (let ((.cse1 (select v_main_a_1631 main_x))) (let ((.cse0 (= (store v_main_a_1631 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 28) .cse0 (= (select v_main_a_1631 main_y) 972))))) [2019-05-15 10:35:56,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:35:56,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:56,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:56,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:56,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,778 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:56,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:56,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:56,806 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:56,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:56,806 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:56,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:56,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1632]. (let ((.cse2 (select v_main_a_1632 main_y))) (let ((.cse0 (select v_main_a_1632 main_x)) (.cse1 (= (store v_main_a_1632 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 29) .cse1 (= .cse2 972))))) [2019-05-15 10:35:56,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:56,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:56,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:57,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:57,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:57,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,048 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:57,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:57,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:57,059 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:57,059 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1633]. (let ((.cse0 (select v_main_a_1633 main_x))) (let ((.cse1 (= (store v_main_a_1633 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 29) (= (select v_main_a_1633 main_y) 971) .cse1)))) [2019-05-15 10:35:57,059 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:35:57,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:57,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:57,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:57,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:57,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:57,187 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,223 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:57,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:57,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:57,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:57,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1634]. (let ((.cse2 (select v_main_a_1634 main_y))) (let ((.cse0 (select v_main_a_1634 main_x)) (.cse1 (= (store v_main_a_1634 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 30) (= .cse2 971) .cse1)))) [2019-05-15 10:35:57,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:57,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:57,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:57,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:57,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:57,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,454 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:57,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:57,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:57,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:57,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1635]. (let ((.cse0 (select v_main_a_1635 main_x))) (let ((.cse1 (= (store v_main_a_1635 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 30) (= (select v_main_a_1635 main_y) 970) .cse1)))) [2019-05-15 10:35:57,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:35:57,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:57,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:57,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:57,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:57,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,635 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:57,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:57,636 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:57,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:57,703 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1636]. (let ((.cse2 (select v_main_a_1636 main_y))) (let ((.cse1 (= (store v_main_a_1636 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1636 main_x))) (or (and (= .cse0 31) .cse1 (= .cse2 970)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:35:57,703 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:57,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:57,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:57,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:57,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:57,847 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:57,882 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:57,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:57,883 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:57,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:57,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1637]. (let ((.cse1 (select v_main_a_1637 main_x))) (let ((.cse0 (= (store v_main_a_1637 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 31) (= (select v_main_a_1637 main_y) 969))))) [2019-05-15 10:35:57,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:35:57,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:58,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:58,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:58,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:58,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,045 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:58,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:58,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:58,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:58,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1638]. (let ((.cse0 (select v_main_a_1638 main_y))) (let ((.cse1 (select v_main_a_1638 main_x)) (.cse2 (= main_a (store v_main_a_1638 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 969) (= 32 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:35:58,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:58,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:58,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:58,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:58,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:58,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,257 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:58,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:58,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:58,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:58,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1639]. (let ((.cse0 (select v_main_a_1639 main_x))) (let ((.cse1 (= main_a (store v_main_a_1639 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 32) (= (select v_main_a_1639 main_y) 968) .cse1)))) [2019-05-15 10:35:58,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:35:58,368 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:58,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:58,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:58,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:58,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:58,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,416 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:58,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:58,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:58,486 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:58,486 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1640]. (let ((.cse2 (select v_main_a_1640 main_y))) (let ((.cse1 (select v_main_a_1640 main_x)) (.cse0 (= (store v_main_a_1640 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 33 .cse1) .cse0 (= 968 .cse2))))) [2019-05-15 10:35:58,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:58,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:58,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:58,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:58,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:58,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,646 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:58,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:58,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:58,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:58,659 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1641]. (let ((.cse1 (select v_main_a_1641 main_x))) (let ((.cse0 (= (store v_main_a_1641 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1641 main_y) 967) (= .cse1 33)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:35:58,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:35:58,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:58,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:58,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:58,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,789 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:58,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:58,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:58,826 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:58,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:58,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:58,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:58,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1642]. (let ((.cse2 (select v_main_a_1642 main_y))) (let ((.cse0 (select v_main_a_1642 main_x)) (.cse1 (= (store v_main_a_1642 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 34) (= .cse2 967) .cse1)))) [2019-05-15 10:35:58,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:35:59,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:59,055 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:59,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:59,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:59,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,086 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:59,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:59,086 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:59,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:59,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1643]. (let ((.cse1 (select v_main_a_1643 main_x))) (let ((.cse0 (= (store v_main_a_1643 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 34) (= (select v_main_a_1643 main_y) 966)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:35:59,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:35:59,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:35:59,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:59,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:59,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:59,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:59,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,245 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:59,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:59,245 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:59,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:59,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1644]. (let ((.cse2 (select v_main_a_1644 main_y))) (let ((.cse1 (= (store v_main_a_1644 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1644 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 966 .cse2) .cse1 (= 35 .cse0))))) [2019-05-15 10:35:59,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:35:59,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:59,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:59,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,384 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:59,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:59,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,411 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:59,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:59,411 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:59,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:59,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1645]. (let ((.cse1 (select v_main_a_1645 main_x))) (let ((.cse0 (= (store v_main_a_1645 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 35) .cse0 (= (select v_main_a_1645 main_y) 965))))) [2019-05-15 10:35:59,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:35:59,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:59,550 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:59,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:59,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:59,557 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,582 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:59,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:59,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:59,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:59,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1646]. (let ((.cse2 (select v_main_a_1646 main_y))) (let ((.cse0 (= main_a (store v_main_a_1646 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1646 main_x))) (or (and .cse0 (= 36 .cse1) (= 965 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:35:59,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:35:59,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:59,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:59,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:59,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:35:59,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,749 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:59,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:59,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:59,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:59,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1647]. (let ((.cse1 (select v_main_a_1647 main_x))) (let ((.cse0 (= (store v_main_a_1647 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1647 main_y) 964) (= .cse1 36)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:35:59,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:35:59,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:35:59,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:59,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:35:59,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:35:59,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:59,923 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:35:59,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:35:59,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:35:59,981 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:59,981 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1648]. (let ((.cse1 (select v_main_a_1648 main_y))) (let ((.cse0 (select v_main_a_1648 main_x)) (.cse2 (= (store v_main_a_1648 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 37) (= 964 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:35:59,981 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:00,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:00,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:00,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:00,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:00,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:00,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:00,156 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:00,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:00,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:00,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:00,168 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1649]. (let ((.cse1 (select v_main_a_1649 main_x))) (let ((.cse0 (= (store v_main_a_1649 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1649 main_y) 963) .cse0 (= 37 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:36:00,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:36:00,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:00,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:00,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:00,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:00,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:00,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:00,335 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:00,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:00,335 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:00,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:00,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1650]. (let ((.cse2 (select v_main_a_1650 main_y))) (let ((.cse1 (= (store v_main_a_1650 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1650 main_x))) (or (and (= 38 .cse0) .cse1 (= 963 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:36:00,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:36:00,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:00,479 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:00,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:00,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:00,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:00,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:00,520 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:00,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:00,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:00,533 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:00,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1651]. (let ((.cse0 (select v_main_a_1651 main_x))) (let ((.cse1 (= (store v_main_a_1651 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1651 main_y) 962) (= 38 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:36:00,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:36:00,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:00,664 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:00,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:00,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:00,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:00,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:00,695 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:00,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:00,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:00,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:00,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1652]. (let ((.cse2 (select v_main_a_1652 main_y))) (let ((.cse0 (select v_main_a_1652 main_x)) (.cse1 (= (store v_main_a_1652 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 39) .cse1 (= .cse2 962)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:36:00,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:00,836 INFO L273 TraceCheckUtils]: 0: Hoare triple {13548#true} a := a[x := 0]; {13553#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:36:00,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {13553#(= (select main_a main_x) 0)} a := a[y := 1000]; {13557#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:36:00,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {13557#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {13561#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:36:00,840 INFO L273 TraceCheckUtils]: 3: Hoare triple {13561#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {13565#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,841 INFO L273 TraceCheckUtils]: 4: Hoare triple {13565#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13569#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:36:00,842 INFO L273 TraceCheckUtils]: 5: Hoare triple {13569#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {13573#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {13573#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13577#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:36:00,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {13577#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {13581#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {13581#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13585#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:36:00,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {13585#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {13589#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {13589#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13593#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:36:00,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {13593#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {13597#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {13597#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13601#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:36:00,851 INFO L273 TraceCheckUtils]: 13: Hoare triple {13601#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {13605#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:36:00,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {13605#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {13609#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:36:00,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {13609#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {13613#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:36:00,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {13613#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {13617#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:36:00,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {13617#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {13621#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:36:00,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {13621#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {13625#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:36:00,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {13625#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {13629#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {13629#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13633#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:36:00,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {13633#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {13637#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {13637#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13641#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:36:00,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {13641#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {13645#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:36:00,864 INFO L273 TraceCheckUtils]: 24: Hoare triple {13645#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {13649#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:36:00,865 INFO L273 TraceCheckUtils]: 25: Hoare triple {13649#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {13653#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {13653#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13657#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:36:00,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {13657#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {13661#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {13661#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13665#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:36:00,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {13665#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {13669#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:36:00,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {13669#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {13673#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:36:00,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {13673#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {13677#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {13677#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13681#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:36:00,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {13681#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {13685#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {13685#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13689#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:36:00,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {13689#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {13693#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:36:00,877 INFO L273 TraceCheckUtils]: 36: Hoare triple {13693#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {13697#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:36:00,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {13697#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {13701#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {13701#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13705#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:36:00,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {13705#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {13709#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:36:00,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {13709#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {13713#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:36:00,883 INFO L273 TraceCheckUtils]: 41: Hoare triple {13713#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {13717#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {13717#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13721#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:36:00,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {13721#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {13725#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,886 INFO L273 TraceCheckUtils]: 44: Hoare triple {13725#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13729#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:36:00,888 INFO L273 TraceCheckUtils]: 45: Hoare triple {13729#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {13733#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:36:00,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {13733#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {13737#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:36:00,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {13737#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {13741#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,891 INFO L273 TraceCheckUtils]: 48: Hoare triple {13741#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13745#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:36:00,892 INFO L273 TraceCheckUtils]: 49: Hoare triple {13745#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {13749#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,893 INFO L273 TraceCheckUtils]: 50: Hoare triple {13749#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13753#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:36:00,894 INFO L273 TraceCheckUtils]: 51: Hoare triple {13753#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {13757#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,896 INFO L273 TraceCheckUtils]: 52: Hoare triple {13757#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13761#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:36:00,897 INFO L273 TraceCheckUtils]: 53: Hoare triple {13761#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {13765#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,898 INFO L273 TraceCheckUtils]: 54: Hoare triple {13765#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13769#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:36:00,899 INFO L273 TraceCheckUtils]: 55: Hoare triple {13769#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {13773#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,900 INFO L273 TraceCheckUtils]: 56: Hoare triple {13773#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13777#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:36:00,901 INFO L273 TraceCheckUtils]: 57: Hoare triple {13777#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {13781#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,902 INFO L273 TraceCheckUtils]: 58: Hoare triple {13781#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13785#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:36:00,903 INFO L273 TraceCheckUtils]: 59: Hoare triple {13785#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {13789#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,905 INFO L273 TraceCheckUtils]: 60: Hoare triple {13789#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13793#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:36:00,906 INFO L273 TraceCheckUtils]: 61: Hoare triple {13793#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {13797#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,907 INFO L273 TraceCheckUtils]: 62: Hoare triple {13797#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13801#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:36:00,908 INFO L273 TraceCheckUtils]: 63: Hoare triple {13801#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {13805#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,909 INFO L273 TraceCheckUtils]: 64: Hoare triple {13805#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13809#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:36:00,910 INFO L273 TraceCheckUtils]: 65: Hoare triple {13809#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {13813#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,912 INFO L273 TraceCheckUtils]: 66: Hoare triple {13813#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13817#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:36:00,913 INFO L273 TraceCheckUtils]: 67: Hoare triple {13817#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {13821#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,914 INFO L273 TraceCheckUtils]: 68: Hoare triple {13821#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13825#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:36:00,915 INFO L273 TraceCheckUtils]: 69: Hoare triple {13825#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {13829#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:36:00,916 INFO L273 TraceCheckUtils]: 70: Hoare triple {13829#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {13833#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:36:00,917 INFO L273 TraceCheckUtils]: 71: Hoare triple {13833#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {13837#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:36:00,918 INFO L273 TraceCheckUtils]: 72: Hoare triple {13837#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {13841#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:36:00,920 INFO L273 TraceCheckUtils]: 73: Hoare triple {13841#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {13845#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:36:00,921 INFO L273 TraceCheckUtils]: 74: Hoare triple {13845#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {13849#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:36:00,922 INFO L273 TraceCheckUtils]: 75: Hoare triple {13849#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {13853#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,923 INFO L273 TraceCheckUtils]: 76: Hoare triple {13853#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {13857#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:36:00,924 INFO L273 TraceCheckUtils]: 77: Hoare triple {13857#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {13861#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:36:00,925 INFO L273 TraceCheckUtils]: 78: Hoare triple {13861#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {13865#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:36:00,926 INFO L273 TraceCheckUtils]: 79: Hoare triple {13865#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {13869#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:00,927 INFO L273 TraceCheckUtils]: 80: Hoare triple {13869#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {13549#false} is VALID [2019-05-15 10:36:00,927 INFO L273 TraceCheckUtils]: 81: Hoare triple {13549#false} assume !(a[y] <= 0); {13549#false} is VALID [2019-05-15 10:36:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:36:00,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:36:00,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-15 10:36:00,953 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-05-15 10:36:00,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:36:00,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states. [2019-05-15 10:36:01,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:01,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-05-15 10:36:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-15 10:36:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-05-15 10:36:01,060 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-05-15 10:36:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:17,712 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:36:17,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-15 10:36:17,712 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-05-15 10:36:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-05-15 10:36:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-05-15 10:36:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-05-15 10:36:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-05-15 10:36:17,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 86 transitions. [2019-05-15 10:36:17,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:17,825 INFO L225 Difference]: With dead ends: 85 [2019-05-15 10:36:17,825 INFO L226 Difference]: Without dead ends: 85 [2019-05-15 10:36:17,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-05-15 10:36:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-05-15 10:36:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-05-15 10:36:17,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:17,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2019-05-15 10:36:17,827 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2019-05-15 10:36:17,827 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2019-05-15 10:36:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:17,828 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:36:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:36:17,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:17,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:17,828 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2019-05-15 10:36:17,828 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2019-05-15 10:36:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:17,829 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:36:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:36:17,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:17,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:17,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:17,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-05-15 10:36:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-05-15 10:36:17,830 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-05-15 10:36:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:17,831 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-05-15 10:36:17,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-05-15 10:36:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:36:17,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-05-15 10:36:17,831 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:17,831 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-05-15 10:36:17,831 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:17,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:17,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1793555285, now seen corresponding path program 40 times [2019-05-15 10:36:17,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:17,958 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-15 10:36:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:17,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:17,982 INFO L375 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 6 treesize of output 5 [2019-05-15 10:36:17,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:17,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:17,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:17,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:17,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:17,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1653]. (= (store v_main_a_1653 main_x 0) main_a) [2019-05-15 10:36:17,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:36:18,027 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:18,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:36:18,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:18,045 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:36:18,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:18,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:36:18,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:18,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1654]. (and (= (select v_main_a_1654 main_x) 0) (= (store v_main_a_1654 main_y 1000) main_a)) [2019-05-15 10:36:18,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:36:18,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:18,091 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:18,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:18,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:18,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:18,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:18,123 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:18,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:18,123 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:18,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:18,133 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1655]. (let ((.cse1 (select v_main_a_1655 main_x))) (let ((.cse0 (= (store v_main_a_1655 main_x (+ .cse1 1)) main_a)) (.cse2 (= (select v_main_a_1655 main_y) 1000))) (or (and .cse0 (= .cse1 0) .cse2) (and (= main_y main_x) .cse0 .cse2)))) [2019-05-15 10:36:18,133 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:36:18,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:18,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:18,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:18,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:18,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:18,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:18,185 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:18,209 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:18,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:18,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:18,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:18,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1656]. (let ((.cse2 (select v_main_a_1656 main_y))) (let ((.cse0 (= (store v_main_a_1656 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1656 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 1) (= .cse2 1000))))) [2019-05-15 10:36:18,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:18,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:18,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:18,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:18,707 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:36:18,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:18,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:18,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:19,368 WARN L188 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:36:19,368 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:19,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:19,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:19,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:19,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1657]. (let ((.cse0 (select v_main_a_1657 main_x))) (let ((.cse1 (= (store v_main_a_1657 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 1) (= (select v_main_a_1657 main_y) 999) .cse1)))) [2019-05-15 10:36:19,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:36:19,736 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-15 10:36:20,065 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:20,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:20,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:20,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:20,404 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:36:20,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:20,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:20,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:20,646 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:36:20,646 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:20,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:20,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:20,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:20,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1658]. (let ((.cse2 (select v_main_a_1658 main_y))) (let ((.cse0 (= (store v_main_a_1658 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1658 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 2) (= .cse2 999))))) [2019-05-15 10:36:20,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:20,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:20,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:20,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:20,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:20,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:20,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:20,764 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:20,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:20,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:20,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:20,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1659]. (let ((.cse1 (select v_main_a_1659 main_x))) (let ((.cse0 (= (store v_main_a_1659 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1659 main_y) 998) .cse0 (= .cse1 2))))) [2019-05-15 10:36:20,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:36:20,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:20,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:20,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:20,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:20,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:20,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:20,835 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:20,860 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:20,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:20,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:20,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:20,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1660]. (let ((.cse2 (select v_main_a_1660 main_y))) (let ((.cse0 (= main_a (store v_main_a_1660 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1660 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 3) (= .cse2 998))))) [2019-05-15 10:36:20,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:20,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:20,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:20,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:20,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:20,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:20,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:20,985 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:20,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:20,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:20,994 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:20,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1661]. (let ((.cse1 (select v_main_a_1661 main_x))) (let ((.cse0 (= (store v_main_a_1661 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1661 main_y) 997) (= 3 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:36:20,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:36:21,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:21,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:21,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:21,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:21,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,081 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:21,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:21,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:21,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:21,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1662]. (let ((.cse0 (select v_main_a_1662 main_y))) (let ((.cse1 (select v_main_a_1662 main_x)) (.cse2 (= (store v_main_a_1662 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 997) (= 4 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:36:21,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:21,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:21,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:21,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:21,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:21,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,265 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:21,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:21,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:21,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:21,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1663]. (let ((.cse1 (select v_main_a_1663 main_x))) (let ((.cse0 (= (store v_main_a_1663 main_x (+ .cse1 1)) main_a))) (or (and (= 996 (select v_main_a_1663 main_y)) .cse0 (= .cse1 4)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:21,279 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:36:21,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:21,336 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:21,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:21,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:21,344 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,368 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:21,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:21,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:21,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:21,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1664]. (let ((.cse2 (select v_main_a_1664 main_y))) (let ((.cse0 (= (store v_main_a_1664 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1664 main_x))) (or (and .cse0 (= .cse1 5) (= .cse2 996)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:36:21,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:21,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:21,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:21,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:21,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:21,465 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,490 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:21,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:21,490 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:21,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:21,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1665]. (let ((.cse1 (select v_main_a_1665 main_x))) (let ((.cse0 (= (store v_main_a_1665 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 5) .cse0 (= (select v_main_a_1665 main_y) 995))))) [2019-05-15 10:36:21,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:36:21,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:21,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:21,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:21,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:21,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,607 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:21,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:21,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:21,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:21,652 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1666]. (let ((.cse1 (select v_main_a_1666 main_y))) (let ((.cse2 (= (store v_main_a_1666 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1666 main_x))) (or (and (= .cse0 6) (= .cse1 995) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:36:21,652 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:21,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:21,712 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:21,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:21,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:21,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,744 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:21,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:21,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:21,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:21,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1667]. (let ((.cse1 (select v_main_a_1667 main_x))) (let ((.cse0 (= main_a (store v_main_a_1667 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1667 main_y) 994) (= .cse1 6)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:36:21,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:36:21,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:21,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:21,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:21,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,947 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:21,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:21,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:21,972 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:21,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:21,973 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:21,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:21,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1668]. (let ((.cse2 (select v_main_a_1668 main_y))) (let ((.cse0 (= (store v_main_a_1668 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1668 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 7) (= .cse2 994))))) [2019-05-15 10:36:21,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:36:22,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:22,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,075 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:22,087 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,087 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1669]. (let ((.cse1 (select v_main_a_1669 main_x))) (let ((.cse0 (= (store v_main_a_1669 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 7) (= (select v_main_a_1669 main_y) 993) .cse0)))) [2019-05-15 10:36:22,087 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:36:22,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:22,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:22,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,181 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,181 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:22,191 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,191 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1670]. (let ((.cse2 (select v_main_a_1670 main_y))) (let ((.cse0 (= (store v_main_a_1670 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1670 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 993 .cse2) .cse0 (= .cse1 8))))) [2019-05-15 10:36:22,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:36:22,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,257 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:22,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,288 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:22,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1671]. (let ((.cse1 (select v_main_a_1671 main_x))) (let ((.cse0 (= (store v_main_a_1671 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 8) (= (select v_main_a_1671 main_y) 992)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:22,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:36:22,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:22,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,397 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:22,409 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,409 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1672]. (let ((.cse0 (select v_main_a_1672 main_y))) (let ((.cse2 (= (store v_main_a_1672 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1672 main_x))) (or (and (= .cse0 992) (= .cse1 9) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:36:22,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:36:22,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:22,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,517 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:22,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1673]. (let ((.cse0 (select v_main_a_1673 main_x))) (let ((.cse1 (= main_a (store v_main_a_1673 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 991 (select v_main_a_1673 main_y)) (= 9 .cse0) .cse1)))) [2019-05-15 10:36:22,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:36:22,581 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:22,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:22,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,629 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:22,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1674]. (let ((.cse2 (select v_main_a_1674 main_y))) (let ((.cse1 (select v_main_a_1674 main_x)) (.cse0 (= (store v_main_a_1674 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 10 .cse1) .cse0 (= 991 .cse2))))) [2019-05-15 10:36:22,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:22,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:22,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,753 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:22,762 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1675]. (let ((.cse1 (select v_main_a_1675 main_x))) (let ((.cse0 (= (store v_main_a_1675 main_x (+ .cse1 1)) main_a))) (or (and (= 990 (select v_main_a_1675 main_y)) .cse0 (= .cse1 10)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:22,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:36:22,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:22,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,868 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,868 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:22,879 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1676]. (let ((.cse0 (select v_main_a_1676 main_y))) (let ((.cse1 (select v_main_a_1676 main_x)) (.cse2 (= (store v_main_a_1676 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 990) (= .cse1 11) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:36:22,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:36:22,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:22,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:22,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:22,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,989 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:22,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:22,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:23,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1677]. (let ((.cse1 (select v_main_a_1677 main_x))) (let ((.cse0 (= (store v_main_a_1677 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1677 main_y) 989) (= .cse1 11)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:23,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:36:23,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:23,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:23,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:23,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,111 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:23,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:23,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:23,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1678]. (let ((.cse1 (select v_main_a_1678 main_y))) (let ((.cse0 (= (store v_main_a_1678 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1678 main_x))) (or (and .cse0 (= 989 .cse1) (= .cse2 12)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:36:23,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:23,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:23,221 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:23,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:23,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,263 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:23,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:23,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:23,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1679]. (let ((.cse0 (select v_main_a_1679 main_x))) (let ((.cse1 (= (store v_main_a_1679 main_x (+ .cse0 1)) main_a))) (or (and (= 12 .cse0) .cse1 (= 988 (select v_main_a_1679 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:36:23,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:36:23,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:23,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:23,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:23,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,398 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:23,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:23,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:23,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1680]. (let ((.cse0 (select v_main_a_1680 main_y))) (let ((.cse1 (= (store v_main_a_1680 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1680 main_x))) (or (and (= .cse0 988) .cse1 (= .cse2 13)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:36:23,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:23,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:23,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:23,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,504 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:23,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,542 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:23,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:23,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:23,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1681]. (let ((.cse0 (select v_main_a_1681 main_x))) (let ((.cse1 (= main_a (store v_main_a_1681 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1681 main_y) 987) (= .cse0 13) .cse1)))) [2019-05-15 10:36:23,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:36:23,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:23,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:23,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:23,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:23,643 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,680 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:23,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:23,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:23,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1682]. (let ((.cse2 (select v_main_a_1682 main_y))) (let ((.cse0 (select v_main_a_1682 main_x)) (.cse1 (= main_a (store v_main_a_1682 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 987) (= .cse0 14) .cse1)))) [2019-05-15 10:36:23,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:36:23,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:23,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:23,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:23,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,806 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:23,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:23,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:23,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1683]. (let ((.cse0 (select v_main_a_1683 main_x))) (let ((.cse1 (= (store v_main_a_1683 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1683 main_y) 986) (= .cse0 14) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:36:23,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:36:23,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:23,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:23,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:23,908 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,934 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:23,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:23,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:23,981 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,982 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1684]. (let ((.cse0 (select v_main_a_1684 main_y))) (let ((.cse1 (= main_a (store v_main_a_1684 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_1684 main_x))) (or (and (= 986 .cse0) .cse1 (= 15 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:36:23,982 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:24,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:24,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:24,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:24,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,102 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:24,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:24,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:24,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1685]. (let ((.cse1 (select v_main_a_1685 main_x))) (let ((.cse0 (= (store v_main_a_1685 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 15) (= (select v_main_a_1685 main_y) 985)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:24,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:36:24,177 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:24,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:24,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:24,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:24,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,239 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:24,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:24,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:24,311 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1686]. (let ((.cse2 (select v_main_a_1686 main_y))) (let ((.cse0 (select v_main_a_1686 main_x)) (.cse1 (= (store v_main_a_1686 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 16 .cse0) (= 985 .cse2) .cse1)))) [2019-05-15 10:36:24,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:24,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:24,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:24,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:24,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,429 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:24,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:24,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:24,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1687]. (let ((.cse1 (select v_main_a_1687 main_x))) (let ((.cse0 (= (store v_main_a_1687 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 16 .cse1) (= (select v_main_a_1687 main_y) 984))))) [2019-05-15 10:36:24,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:36:24,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:24,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:24,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:24,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,569 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:24,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:24,569 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:24,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1688]. (let ((.cse0 (select v_main_a_1688 main_y))) (let ((.cse2 (= (store v_main_a_1688 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1688 main_x))) (or (and (= .cse0 984) (= .cse1 17) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:36:24,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:36:24,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:24,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:24,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:24,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,703 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:24,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:24,703 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:24,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1689]. (let ((.cse1 (select v_main_a_1689 main_x))) (let ((.cse0 (= (store v_main_a_1689 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 17) .cse0 (= (select v_main_a_1689 main_y) 983))))) [2019-05-15 10:36:24,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:36:24,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:24,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:24,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:24,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:24,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,850 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:24,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:24,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:24,913 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,913 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1690]. (let ((.cse2 (select v_main_a_1690 main_y))) (let ((.cse1 (= (store v_main_a_1690 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1690 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 983) .cse1 (= .cse0 18))))) [2019-05-15 10:36:24,913 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:24,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:24,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:24,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:25,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,037 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:25,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:25,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:25,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1691]. (let ((.cse0 (select v_main_a_1691 main_x))) (let ((.cse1 (= main_a (store v_main_a_1691 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1691 main_y) 982) .cse1 (= .cse0 18))))) [2019-05-15 10:36:25,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:36:25,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:25,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:25,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:25,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,176 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:25,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:25,177 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:25,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1692]. (let ((.cse2 (select v_main_a_1692 main_y))) (let ((.cse0 (= (store v_main_a_1692 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1692 main_x))) (or (and .cse0 (= .cse1 19) (= .cse2 982)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:36:25,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:36:25,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:25,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:25,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:25,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,311 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:25,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:25,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:25,323 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,323 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1693]. (let ((.cse1 (select v_main_a_1693 main_x))) (let ((.cse0 (= (store v_main_a_1693 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 19 .cse1) .cse0 (= (select v_main_a_1693 main_y) 981))))) [2019-05-15 10:36:25,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:36:25,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:25,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:25,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:25,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:25,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,467 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:25,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:25,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:25,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1694]. (let ((.cse2 (select v_main_a_1694 main_y))) (let ((.cse1 (= (store v_main_a_1694 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1694 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 981 .cse2) .cse1 (= 20 .cse0))))) [2019-05-15 10:36:25,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:25,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:25,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:25,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:25,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,631 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:25,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:25,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:25,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1695]. (let ((.cse1 (select v_main_a_1695 main_x))) (let ((.cse0 (= (store v_main_a_1695 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 20) (= (select v_main_a_1695 main_y) 980)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:36:25,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:36:25,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:25,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:25,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:25,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:25,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,772 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:25,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:25,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:25,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1696]. (let ((.cse2 (select v_main_a_1696 main_y))) (let ((.cse0 (select v_main_a_1696 main_x)) (.cse1 (= (store v_main_a_1696 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 980) (= .cse0 21) .cse1)))) [2019-05-15 10:36:25,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:25,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:25,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:25,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:25,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,976 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:25,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:25,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:25,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1697]. (let ((.cse1 (select v_main_a_1697 main_x))) (let ((.cse0 (= (store v_main_a_1697 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1697 main_y) 979) .cse0 (= .cse1 21))))) [2019-05-15 10:36:25,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:36:26,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:26,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:26,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:26,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,126 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:26,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:26,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:26,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1698]. (let ((.cse1 (select v_main_a_1698 main_y))) (let ((.cse0 (select v_main_a_1698 main_x)) (.cse2 (= (store v_main_a_1698 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 22) (= .cse1 979) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:36:26,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:36:26,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:26,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:26,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:26,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,271 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:26,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:26,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:26,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1699]. (let ((.cse0 (select v_main_a_1699 main_x))) (let ((.cse1 (= (store v_main_a_1699 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 978 (select v_main_a_1699 main_y)) .cse1 (= 22 .cse0))))) [2019-05-15 10:36:26,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:36:26,370 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:26,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:26,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:26,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:26,396 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,434 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:26,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:26,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:26,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1700]. (let ((.cse2 (select v_main_a_1700 main_y))) (let ((.cse0 (= (store v_main_a_1700 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1700 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 978) (= .cse1 23))))) [2019-05-15 10:36:26,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:26,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:26,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:26,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:26,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,655 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:26,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:26,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:26,670 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,670 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1701]. (let ((.cse1 (select v_main_a_1701 main_x))) (let ((.cse0 (= main_a (store v_main_a_1701 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1701 main_y) 977) (= .cse1 23)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:26,670 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:36:26,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:26,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:26,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:26,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,810 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:26,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:26,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:26,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1702]. (let ((.cse2 (select v_main_a_1702 main_y))) (let ((.cse0 (select v_main_a_1702 main_x)) (.cse1 (= (store v_main_a_1702 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 24) .cse1 (= .cse2 977)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:36:26,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:26,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:27,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:27,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:27,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,045 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:27,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:27,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:27,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1703]. (let ((.cse1 (select v_main_a_1703 main_x))) (let ((.cse0 (= main_a (store v_main_a_1703 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_1703 main_y) 976) .cse0 (= .cse1 24)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:27,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:36:27,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:27,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:27,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:27,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,202 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:27,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:27,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:27,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1704]. (let ((.cse0 (select v_main_a_1704 main_y))) (let ((.cse1 (= (store v_main_a_1704 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1704 main_x))) (or (and (= 976 .cse0) .cse1 (= 25 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:36:27,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:27,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:27,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:27,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:27,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,391 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:27,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:27,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:27,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1705]. (let ((.cse1 (select v_main_a_1705 main_x))) (let ((.cse0 (= (store v_main_a_1705 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1705 main_y) 975) .cse0 (= .cse1 25)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:36:27,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:36:27,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:27,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:27,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:27,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,559 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:27,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:27,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:27,609 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,609 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1706]. (let ((.cse0 (select v_main_a_1706 main_y))) (let ((.cse2 (= (store v_main_a_1706 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1706 main_x))) (or (and (= .cse0 975) (= .cse1 26) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:36:27,610 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:27,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:27,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:27,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:27,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,751 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:27,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:27,752 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:27,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1707]. (let ((.cse1 (select v_main_a_1707 main_x))) (let ((.cse0 (= (store v_main_a_1707 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1707 main_y) 974) (= .cse1 26) .cse0)))) [2019-05-15 10:36:27,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:36:27,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:27,875 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:27,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:27,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,910 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:27,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:27,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:27,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1708]. (let ((.cse2 (select v_main_a_1708 main_y))) (let ((.cse1 (= (store v_main_a_1708 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1708 main_x))) (or (and (= .cse0 27) .cse1 (= .cse2 974)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:36:27,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:28,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:28,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:28,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:28,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:28,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,139 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:28,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:28,139 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:28,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:28,148 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1709]. (let ((.cse1 (select v_main_a_1709 main_x))) (let ((.cse0 (= main_a (store v_main_a_1709 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 27) (= (select v_main_a_1709 main_y) 973)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:28,148 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:36:28,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:28,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:28,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:28,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:28,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,299 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:28,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:28,299 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:28,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:28,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1710]. (let ((.cse2 (select v_main_a_1710 main_y))) (let ((.cse0 (select v_main_a_1710 main_x)) (.cse1 (= (store v_main_a_1710 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 28) .cse1 (= .cse2 973)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:36:28,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:28,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:28,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:28,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:28,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:28,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,502 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:28,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:28,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:28,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:28,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1711]. (let ((.cse0 (select v_main_a_1711 main_x))) (let ((.cse1 (= (store v_main_a_1711 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 28) (= (select v_main_a_1711 main_y) 972) .cse1)))) [2019-05-15 10:36:28,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:36:28,637 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:28,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:28,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:28,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:28,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:28,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,684 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:28,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:28,685 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:28,754 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:28,755 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1712]. (let ((.cse2 (select v_main_a_1712 main_y))) (let ((.cse1 (select v_main_a_1712 main_x)) (.cse0 (= (store v_main_a_1712 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 29) .cse0 (= .cse2 972))))) [2019-05-15 10:36:28,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:28,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:28,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:28,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:28,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:28,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:28,892 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:28,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:28,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:28,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:28,906 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1713]. (let ((.cse1 (select v_main_a_1713 main_x))) (let ((.cse0 (= (store v_main_a_1713 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1713 main_y) 971) (= .cse1 29))))) [2019-05-15 10:36:28,906 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:36:29,000 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:29,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:29,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:29,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:29,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:29,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,058 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:29,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:29,058 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:29,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:29,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1714]. (let ((.cse2 (select v_main_a_1714 main_y))) (let ((.cse0 (= (store v_main_a_1714 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1714 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 971) (= .cse1 30))))) [2019-05-15 10:36:29,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:29,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:29,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:29,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:29,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:29,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,304 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:29,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:29,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:29,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:29,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1715]. (let ((.cse1 (select v_main_a_1715 main_x))) (let ((.cse0 (= (store v_main_a_1715 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 30 .cse1) (= 970 (select v_main_a_1715 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:36:29,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:36:29,412 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:29,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:29,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:29,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,434 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:29,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:29,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,471 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:29,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:29,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:29,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:29,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1716]. (let ((.cse2 (select v_main_a_1716 main_y))) (let ((.cse0 (= (store v_main_a_1716 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1716 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 970) (= .cse1 31))))) [2019-05-15 10:36:29,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:29,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:29,652 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:29,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:29,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:29,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,695 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:29,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:29,695 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:29,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:29,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1717]. (let ((.cse1 (select v_main_a_1717 main_x))) (let ((.cse0 (= (store v_main_a_1717 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 31 .cse1) (= 969 (select v_main_a_1717 main_y))) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:36:29,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:36:29,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:29,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:29,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:29,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:29,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:29,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:29,856 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:29,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:29,856 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:29,933 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:29,933 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1718]. (let ((.cse2 (select v_main_a_1718 main_y))) (let ((.cse0 (select v_main_a_1718 main_x)) (.cse1 (= (store v_main_a_1718 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 32) (= .cse2 969) .cse1)))) [2019-05-15 10:36:29,933 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:30,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:30,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:30,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,054 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:30,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:30,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,092 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:30,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:30,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:30,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:30,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1719]. (let ((.cse1 (select v_main_a_1719 main_x))) (let ((.cse0 (= (store v_main_a_1719 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 32) .cse0 (= (select v_main_a_1719 main_y) 968))))) [2019-05-15 10:36:30,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:36:30,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:30,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:30,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:30,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:30,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:30,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,257 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:30,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:30,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:30,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:30,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1720]. (let ((.cse2 (select v_main_a_1720 main_y))) (let ((.cse0 (select v_main_a_1720 main_x)) (.cse1 (= (store v_main_a_1720 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 33 .cse0) .cse1 (= 968 .cse2))))) [2019-05-15 10:36:30,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:30,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:30,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:30,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:30,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:30,440 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,475 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:30,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:30,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:30,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:30,487 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1721]. (let ((.cse0 (select v_main_a_1721 main_x))) (let ((.cse1 (= main_a (store v_main_a_1721 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 33) (= (select v_main_a_1721 main_y) 967) .cse1)))) [2019-05-15 10:36:30,487 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:36:30,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:30,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:30,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:30,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:30,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,654 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:30,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:30,654 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:30,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:30,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1722]. (let ((.cse0 (select v_main_a_1722 main_y))) (let ((.cse1 (= (store v_main_a_1722 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1722 main_x))) (or (and (= .cse0 967) .cse1 (= .cse2 34)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:36:30,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:30,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:30,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:30,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:30,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:30,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:30,878 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:30,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:30,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:30,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:30,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1723]. (let ((.cse0 (select v_main_a_1723 main_x))) (let ((.cse1 (= main_a (store v_main_a_1723 main_x (+ .cse0 1))))) (or (and (= .cse0 34) (= (select v_main_a_1723 main_y) 966) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:36:30,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:36:31,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:31,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:31,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:31,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:31,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,045 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:31,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:31,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:31,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:31,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1724]. (let ((.cse1 (select v_main_a_1724 main_y))) (let ((.cse0 (= (store v_main_a_1724 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1724 main_x))) (or (and .cse0 (= 966 .cse1) (= 35 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:36:31,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:36:31,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:31,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:31,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:31,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:31,189 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,215 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:31,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:31,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:31,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:31,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1725]. (let ((.cse1 (select v_main_a_1725 main_x))) (let ((.cse0 (= (store v_main_a_1725 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 35) (= (select v_main_a_1725 main_y) 965)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:31,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:36:31,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:31,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:31,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:31,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:31,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,390 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:31,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:31,391 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:31,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:31,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1726]. (let ((.cse0 (select v_main_a_1726 main_y))) (let ((.cse2 (= (store v_main_a_1726 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1726 main_x))) (or (and (= .cse0 965) (= .cse1 36) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:36:31,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:36:31,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:31,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:31,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:31,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:31,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,564 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:31,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:31,565 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:31,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:31,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1727]. (let ((.cse1 (select v_main_a_1727 main_x))) (let ((.cse0 (= (store v_main_a_1727 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1727 main_y) 964) .cse0 (= .cse1 36)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:36:31,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:36:31,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:31,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:31,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:31,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:31,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,743 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:31,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:31,743 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:31,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:31,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1728]. (let ((.cse1 (select v_main_a_1728 main_y))) (let ((.cse0 (= (store v_main_a_1728 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1728 main_x))) (or (and .cse0 (= .cse1 964) (= 37 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:36:31,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:31,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:31,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:31,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:31,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:31,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:31,985 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:31,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:31,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:31,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:31,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1729]. (let ((.cse1 (select v_main_a_1729 main_x))) (let ((.cse0 (= (store v_main_a_1729 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= 963 (select v_main_a_1729 main_y)) (= .cse1 37))))) [2019-05-15 10:36:31,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:36:32,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:32,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:32,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:32,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:32,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,162 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:32,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:32,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:32,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:32,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1730]. (let ((.cse1 (select v_main_a_1730 main_y))) (let ((.cse2 (= (store v_main_a_1730 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1730 main_x))) (or (and (= .cse0 38) (= 963 .cse1) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:36:32,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:36:32,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:32,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:32,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:32,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:32,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,425 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:32,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:32,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:32,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:32,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1731]. (let ((.cse0 (select v_main_a_1731 main_x))) (let ((.cse1 (= (store v_main_a_1731 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 38) .cse1 (= (select v_main_a_1731 main_y) 962))))) [2019-05-15 10:36:32,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:36:32,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:32,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:32,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:32,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:32,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,608 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:32,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:32,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:32,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:32,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1732]. (let ((.cse0 (select v_main_a_1732 main_y))) (let ((.cse2 (select v_main_a_1732 main_x)) (.cse1 (= (store v_main_a_1732 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 962 .cse0) .cse1 (= .cse2 39)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:36:32,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:32,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:32,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:32,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,816 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:32,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:32,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,843 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:32,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:32,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:32,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:32,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1733]. (let ((.cse1 (select v_main_a_1733 main_x))) (let ((.cse0 (= (store v_main_a_1733 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1733 main_y) 961) (= .cse1 39))))) [2019-05-15 10:36:32,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 961) (= .cse0 40)))) [2019-05-15 10:36:32,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:32,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:32,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:32,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:32,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:32,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:33,023 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:33,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:33,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:33,094 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:33,094 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1734]. (let ((.cse1 (select v_main_a_1734 main_y))) (let ((.cse0 (= main_a (store v_main_a_1734 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_1734 main_x))) (or (and .cse0 (= .cse1 961) (= .cse2 40)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:36:33,094 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:33,214 INFO L273 TraceCheckUtils]: 0: Hoare triple {14215#true} a := a[x := 0]; {14220#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:36:33,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {14220#(= (select main_a main_x) 0)} a := a[y := 1000]; {14224#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:36:33,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {14224#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {14228#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:36:33,217 INFO L273 TraceCheckUtils]: 3: Hoare triple {14228#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {14232#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,218 INFO L273 TraceCheckUtils]: 4: Hoare triple {14232#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14236#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:36:33,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {14236#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {14240#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {14240#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14244#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:36:33,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {14244#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {14248#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {14248#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14252#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:36:33,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {14252#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {14256#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {14256#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14260#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:36:33,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {14260#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {14264#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {14264#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14268#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:36:33,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {14268#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {14272#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:36:33,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {14272#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {14276#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:36:33,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {14276#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {14280#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:36:33,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {14280#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {14284#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:36:33,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {14284#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {14288#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:36:33,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {14288#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {14292#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:36:33,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {14292#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {14296#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {14296#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14300#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:36:33,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {14300#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {14304#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {14304#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14308#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:36:33,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {14308#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {14312#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:36:33,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {14312#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {14316#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:36:33,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {14316#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {14320#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {14320#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14324#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:36:33,245 INFO L273 TraceCheckUtils]: 27: Hoare triple {14324#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {14328#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {14328#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14332#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:36:33,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {14332#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {14336#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:36:33,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {14336#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {14340#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:36:33,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {14340#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {14344#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {14344#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14348#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:36:33,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {14348#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {14352#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {14352#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14356#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:36:33,254 INFO L273 TraceCheckUtils]: 35: Hoare triple {14356#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {14360#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:36:33,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {14360#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {14364#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:36:33,256 INFO L273 TraceCheckUtils]: 37: Hoare triple {14364#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {14368#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {14368#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14372#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:36:33,258 INFO L273 TraceCheckUtils]: 39: Hoare triple {14372#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {14376#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:36:33,259 INFO L273 TraceCheckUtils]: 40: Hoare triple {14376#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {14380#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:36:33,261 INFO L273 TraceCheckUtils]: 41: Hoare triple {14380#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {14384#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {14384#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14388#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:36:33,263 INFO L273 TraceCheckUtils]: 43: Hoare triple {14388#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {14392#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {14392#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14396#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:36:33,265 INFO L273 TraceCheckUtils]: 45: Hoare triple {14396#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {14400#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:36:33,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {14400#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {14404#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:36:33,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {14404#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {14408#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,269 INFO L273 TraceCheckUtils]: 48: Hoare triple {14408#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14412#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:36:33,270 INFO L273 TraceCheckUtils]: 49: Hoare triple {14412#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {14416#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,271 INFO L273 TraceCheckUtils]: 50: Hoare triple {14416#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14420#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:36:33,272 INFO L273 TraceCheckUtils]: 51: Hoare triple {14420#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {14424#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {14424#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14428#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:36:33,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {14428#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {14432#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,275 INFO L273 TraceCheckUtils]: 54: Hoare triple {14432#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14436#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:36:33,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {14436#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {14440#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,278 INFO L273 TraceCheckUtils]: 56: Hoare triple {14440#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14444#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:36:33,279 INFO L273 TraceCheckUtils]: 57: Hoare triple {14444#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {14448#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,280 INFO L273 TraceCheckUtils]: 58: Hoare triple {14448#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14452#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:36:33,281 INFO L273 TraceCheckUtils]: 59: Hoare triple {14452#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {14456#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,282 INFO L273 TraceCheckUtils]: 60: Hoare triple {14456#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14460#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:36:33,283 INFO L273 TraceCheckUtils]: 61: Hoare triple {14460#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {14464#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,285 INFO L273 TraceCheckUtils]: 62: Hoare triple {14464#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14468#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:36:33,286 INFO L273 TraceCheckUtils]: 63: Hoare triple {14468#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {14472#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,287 INFO L273 TraceCheckUtils]: 64: Hoare triple {14472#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14476#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:36:33,288 INFO L273 TraceCheckUtils]: 65: Hoare triple {14476#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {14480#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,289 INFO L273 TraceCheckUtils]: 66: Hoare triple {14480#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14484#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:36:33,291 INFO L273 TraceCheckUtils]: 67: Hoare triple {14484#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {14488#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,292 INFO L273 TraceCheckUtils]: 68: Hoare triple {14488#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14492#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:36:33,293 INFO L273 TraceCheckUtils]: 69: Hoare triple {14492#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {14496#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:36:33,294 INFO L273 TraceCheckUtils]: 70: Hoare triple {14496#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {14500#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:36:33,295 INFO L273 TraceCheckUtils]: 71: Hoare triple {14500#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {14504#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:36:33,296 INFO L273 TraceCheckUtils]: 72: Hoare triple {14504#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {14508#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:36:33,298 INFO L273 TraceCheckUtils]: 73: Hoare triple {14508#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {14512#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:36:33,299 INFO L273 TraceCheckUtils]: 74: Hoare triple {14512#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {14516#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:36:33,300 INFO L273 TraceCheckUtils]: 75: Hoare triple {14516#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {14520#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,301 INFO L273 TraceCheckUtils]: 76: Hoare triple {14520#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14524#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:36:33,302 INFO L273 TraceCheckUtils]: 77: Hoare triple {14524#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {14528#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:36:33,303 INFO L273 TraceCheckUtils]: 78: Hoare triple {14528#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {14532#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:36:33,304 INFO L273 TraceCheckUtils]: 79: Hoare triple {14532#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {14536#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,306 INFO L273 TraceCheckUtils]: 80: Hoare triple {14536#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14540#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} is VALID [2019-05-15 10:36:33,307 INFO L273 TraceCheckUtils]: 81: Hoare triple {14540#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} a := a[y := a[y] - 1]; {14544#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:36:33,307 INFO L273 TraceCheckUtils]: 82: Hoare triple {14544#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {14216#false} is VALID [2019-05-15 10:36:33,308 INFO L273 TraceCheckUtils]: 83: Hoare triple {14216#false} assume !(a[y] <= 0); {14216#false} is VALID [2019-05-15 10:36:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:36:33,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:36:33,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-15 10:36:33,336 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-05-15 10:36:33,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:36:33,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states. [2019-05-15 10:36:33,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:33,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-05-15 10:36:33,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-15 10:36:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-05-15 10:36:33,453 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-05-15 10:36:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:51,127 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:36:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-15 10:36:51,128 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-05-15 10:36:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-05-15 10:36:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-05-15 10:36:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-05-15 10:36:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-05-15 10:36:51,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2019-05-15 10:36:51,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:51,241 INFO L225 Difference]: With dead ends: 87 [2019-05-15 10:36:51,241 INFO L226 Difference]: Without dead ends: 87 [2019-05-15 10:36:51,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-05-15 10:36:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-05-15 10:36:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-05-15 10:36:51,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:51,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2019-05-15 10:36:51,243 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2019-05-15 10:36:51,243 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2019-05-15 10:36:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:51,245 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:36:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:36:51,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:51,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:51,245 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2019-05-15 10:36:51,245 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2019-05-15 10:36:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:51,246 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:36:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:36:51,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:51,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:51,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:51,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-05-15 10:36:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-05-15 10:36:51,248 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-05-15 10:36:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:51,248 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-05-15 10:36:51,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-05-15 10:36:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:36:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-05-15 10:36:51,249 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:51,249 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-05-15 10:36:51,249 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1324896628, now seen corresponding path program 41 times [2019-05-15 10:36:51,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:51,421 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-15 10:36:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:51,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:51,548 INFO L375 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 6 treesize of output 5 [2019-05-15 10:36:51,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:51,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:51,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:51,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:51,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:51,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1735]. (= (store v_main_a_1735 main_x 0) main_a) [2019-05-15 10:36:51,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:36:51,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:51,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:36:51,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:51,618 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:36:51,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:51,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:36:51,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:51,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1736]. (and (= 0 (select v_main_a_1736 main_x)) (= (store v_main_a_1736 main_y 1000) main_a)) [2019-05-15 10:36:51,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:36:51,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:51,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:51,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:51,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:51,680 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:51,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:51,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:51,706 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:51,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:51,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:51,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:51,718 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1737]. (let ((.cse2 (select v_main_a_1737 main_x))) (let ((.cse0 (= (store v_main_a_1737 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_1737 main_y) 1000))) (or (and .cse0 (= main_y main_x) .cse1) (and .cse0 (= .cse2 0) .cse1)))) [2019-05-15 10:36:51,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:36:51,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:51,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:51,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:51,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:51,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:51,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:51,795 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:51,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:51,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:51,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:51,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1738]. (let ((.cse0 (select v_main_a_1738 main_y))) (let ((.cse1 (select v_main_a_1738 main_x)) (.cse2 (= main_a (store v_main_a_1738 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 1000) (= .cse1 1) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:36:51,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:51,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:51,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:51,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,076 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1739]. (let ((.cse0 (select v_main_a_1739 main_x))) (let ((.cse1 (= (store v_main_a_1739 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 1 .cse0) (= (select v_main_a_1739 main_y) 999) .cse1)))) [2019-05-15 10:36:52,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:36:52,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:52,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:52,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,181 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,181 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,213 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,214 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1740]. (let ((.cse1 (select v_main_a_1740 main_y))) (let ((.cse0 (select v_main_a_1740 main_x)) (.cse2 (= (store v_main_a_1740 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 2 .cse0) (= 999 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:36:52,214 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:52,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:52,265 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:52,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,295 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,309 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1741]. (let ((.cse0 (select v_main_a_1741 main_x))) (let ((.cse1 (= main_a (store v_main_a_1741 main_x (+ .cse0 1))))) (or (and (= (select v_main_a_1741 main_y) 998) (= .cse0 2) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:36:52,309 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:36:52,343 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:52,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:52,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:52,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,363 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,389 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1742]. (let ((.cse2 (select v_main_a_1742 main_y))) (let ((.cse0 (select v_main_a_1742 main_x)) (.cse1 (= (store v_main_a_1742 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 3) (= .cse2 998) .cse1)))) [2019-05-15 10:36:52,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:52,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:52,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:52,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,518 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1743]. (let ((.cse1 (select v_main_a_1743 main_x))) (let ((.cse0 (= (store v_main_a_1743 main_x (+ .cse1 1)) main_a))) (or (and (= 997 (select v_main_a_1743 main_y)) .cse0 (= 3 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:36:52,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:36:52,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:52,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:52,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:52,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,616 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1744]. (let ((.cse2 (select v_main_a_1744 main_y))) (let ((.cse0 (select v_main_a_1744 main_x)) (.cse1 (= (store v_main_a_1744 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 997) (= .cse0 4) .cse1)))) [2019-05-15 10:36:52,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:52,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:52,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:52,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,746 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,754 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,755 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1745]. (let ((.cse1 (select v_main_a_1745 main_x))) (let ((.cse0 (= (store v_main_a_1745 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 996 (select v_main_a_1745 main_y)) (= 4 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:36:52,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:36:52,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:52,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:52,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:52,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,842 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1746]. (let ((.cse2 (select v_main_a_1746 main_y))) (let ((.cse0 (select v_main_a_1746 main_x)) (.cse1 (= (store v_main_a_1746 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 996) (= .cse0 5) .cse1)))) [2019-05-15 10:36:52,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:52,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:52,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:52,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:52,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:52,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:52,976 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:52,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:52,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:52,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:52,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1747]. (let ((.cse0 (select v_main_a_1747 main_x))) (let ((.cse1 (= (store v_main_a_1747 main_x (+ .cse0 1)) main_a))) (or (and (= 5 .cse0) .cse1 (= 995 (select v_main_a_1747 main_y))) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:36:52,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:36:53,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:53,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:53,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,055 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,092 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:53,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:53,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:53,142 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:53,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1748]. (let ((.cse2 (select v_main_a_1748 main_y))) (let ((.cse0 (select v_main_a_1748 main_x)) (.cse1 (= (store v_main_a_1748 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 6) (= 995 .cse2) .cse1)))) [2019-05-15 10:36:53,142 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:53,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,201 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:53,208 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,232 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:53,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:53,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:53,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:53,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1749]. (let ((.cse1 (select v_main_a_1749 main_x))) (let ((.cse0 (= (store v_main_a_1749 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 6 .cse1) (= (select v_main_a_1749 main_y) 994)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:36:53,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:36:53,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:53,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,334 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:53,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:53,335 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:53,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:53,346 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1750]. (let ((.cse1 (select v_main_a_1750 main_y))) (let ((.cse2 (select v_main_a_1750 main_x)) (.cse0 (= (store v_main_a_1750 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= .cse1 994) (= .cse2 7)) (and (= main_y main_x) (= .cse2 1001) .cse0)))) [2019-05-15 10:36:53,346 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:36:53,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:53,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,443 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:53,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:53,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:53,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:53,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1751]. (let ((.cse1 (select v_main_a_1751 main_x))) (let ((.cse0 (= (store v_main_a_1751 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1751 main_y) 993) .cse0 (= .cse1 7)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:53,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:36:53,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:53,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,552 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:53,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:53,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:53,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:53,585 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1752]. (let ((.cse0 (select v_main_a_1752 main_y))) (let ((.cse1 (select v_main_a_1752 main_x)) (.cse2 (= main_a (store v_main_a_1752 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 993) (= .cse1 8) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:36:53,585 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:53,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:53,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,654 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,680 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:53,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:53,681 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:53,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:53,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1753]. (let ((.cse0 (select v_main_a_1753 main_x))) (let ((.cse1 (= (store v_main_a_1753 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 8) (= 992 (select v_main_a_1753 main_y)) .cse1)))) [2019-05-15 10:36:53,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:36:53,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:53,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:53,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,766 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,791 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:53,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:53,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:53,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:53,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1754]. (let ((.cse2 (select v_main_a_1754 main_y))) (let ((.cse0 (select v_main_a_1754 main_x)) (.cse1 (= main_a (store v_main_a_1754 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 9) .cse1 (= .cse2 992))))) [2019-05-15 10:36:53,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:36:53,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:53,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,913 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:53,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:53,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:53,922 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:53,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1755]. (let ((.cse1 (select v_main_a_1755 main_x))) (let ((.cse0 (= (store v_main_a_1755 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 991 (select v_main_a_1755 main_y)) .cse0 (= 9 .cse1))))) [2019-05-15 10:36:53,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:36:53,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:53,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:53,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:53,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:53,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:54,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,025 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:54,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:54,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:54,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:54,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1756]. (let ((.cse1 (select v_main_a_1756 main_y))) (let ((.cse0 (= (store v_main_a_1756 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1756 main_x))) (or (and .cse0 (= 991 .cse1) (= 10 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:36:54,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:54,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:54,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:54,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:54,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:54,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,152 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:54,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:54,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:54,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:54,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1757]. (let ((.cse0 (select v_main_a_1757 main_x))) (let ((.cse1 (= (store v_main_a_1757 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 10) .cse1 (= (select v_main_a_1757 main_y) 990)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:36:54,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:36:54,221 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:54,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:54,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:54,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:54,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:54,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,270 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:54,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:54,271 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:54,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:54,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1758]. (let ((.cse2 (select v_main_a_1758 main_y))) (let ((.cse0 (= (store v_main_a_1758 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1758 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 11) (= .cse2 990))))) [2019-05-15 10:36:54,279 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:36:54,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:54,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:54,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:54,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:54,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,382 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:54,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:54,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:54,396 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:54,396 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1759]. (let ((.cse1 (select v_main_a_1759 main_x))) (let ((.cse0 (= main_a (store v_main_a_1759 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= 989 (select v_main_a_1759 main_y)) (= .cse1 11))))) [2019-05-15 10:36:54,396 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:36:54,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:54,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:54,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:54,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:54,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,510 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:54,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:54,511 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:54,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:54,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1760]. (let ((.cse2 (select v_main_a_1760 main_y))) (let ((.cse1 (= (store v_main_a_1760 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1760 main_x))) (or (and (= 12 .cse0) .cse1 (= 989 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:36:54,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:54,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:54,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:54,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:54,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:54,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,651 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:54,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:54,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:54,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:54,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1761]. (let ((.cse0 (select v_main_a_1761 main_x))) (let ((.cse1 (= (store v_main_a_1761 main_x (+ .cse0 1)) main_a))) (or (and (= 12 .cse0) (= 988 (select v_main_a_1761 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:36:54,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:36:54,724 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:54,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:54,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:54,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:54,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:54,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,784 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:54,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:54,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:54,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:54,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1762]. (let ((.cse2 (select v_main_a_1762 main_y))) (let ((.cse1 (= (store v_main_a_1762 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1762 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= .cse2 988) .cse1 (= 13 .cse0))))) [2019-05-15 10:36:54,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:54,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:54,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:54,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:54,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:54,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:54,953 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:54,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:54,953 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:54,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:54,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1763]. (let ((.cse0 (select v_main_a_1763 main_x))) (let ((.cse1 (= (store v_main_a_1763 main_x (+ .cse0 1)) main_a))) (or (and (= 13 .cse0) (= (select v_main_a_1763 main_y) 987) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:36:54,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:36:55,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:55,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:55,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:55,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:55,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,088 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:55,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:55,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:55,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:55,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1764]. (let ((.cse1 (select v_main_a_1764 main_y))) (let ((.cse0 (select v_main_a_1764 main_x)) (.cse2 (= (store v_main_a_1764 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 14 .cse0) (= 987 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:36:55,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:36:55,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:55,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:55,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:55,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:55,189 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,214 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:55,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:55,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:55,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:55,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1765]. (let ((.cse1 (select v_main_a_1765 main_x))) (let ((.cse0 (= main_a (store v_main_a_1765 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1765 main_y) 986) (= .cse1 14)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:36:55,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:36:55,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:55,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:55,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:55,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:55,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,345 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:55,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:55,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:55,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:55,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1766]. (let ((.cse0 (select v_main_a_1766 main_y))) (let ((.cse2 (select v_main_a_1766 main_x)) (.cse1 (= (store v_main_a_1766 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 986 .cse0) .cse1 (= .cse2 15)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:36:55,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:55,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:55,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:55,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:55,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:55,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,502 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:55,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:55,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:55,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:55,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1767]. (let ((.cse0 (select v_main_a_1767 main_x))) (let ((.cse1 (= (store v_main_a_1767 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 15) .cse1 (= (select v_main_a_1767 main_y) 985)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:36:55,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:36:55,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:55,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:55,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:55,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,606 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:55,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:55,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,643 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:55,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:55,644 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:55,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:55,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1768]. (let ((.cse2 (select v_main_a_1768 main_y))) (let ((.cse1 (= (store v_main_a_1768 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1768 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 16) (= .cse2 985))))) [2019-05-15 10:36:55,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:55,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:55,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:55,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:55,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:55,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,832 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:55,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:55,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:55,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:55,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1769]. (let ((.cse1 (select v_main_a_1769 main_x))) (let ((.cse0 (= (store v_main_a_1769 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1769 main_y) 984) .cse0 (= .cse1 16))))) [2019-05-15 10:36:55,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:36:55,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:55,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:55,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:55,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:55,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:55,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:55,969 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:55,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:55,969 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:55,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:55,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1770]. (let ((.cse2 (select v_main_a_1770 main_y))) (let ((.cse0 (= main_a (store v_main_a_1770 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1770 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 17 .cse1) (= 984 .cse2))))) [2019-05-15 10:36:55,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:36:56,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:56,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:56,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:56,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,109 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:56,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:56,110 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:56,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1771]. (let ((.cse1 (select v_main_a_1771 main_x))) (let ((.cse0 (= (store v_main_a_1771 main_x (+ .cse1 1)) main_a))) (or (and (= 983 (select v_main_a_1771 main_y)) .cse0 (= 17 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:36:56,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:36:56,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:56,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:56,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:56,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:56,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,257 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:56,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:56,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:56,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1772]. (let ((.cse2 (select v_main_a_1772 main_y))) (let ((.cse0 (= (store v_main_a_1772 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1772 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 983) .cse0 (= .cse1 18))))) [2019-05-15 10:36:56,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:56,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:56,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:56,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:56,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,427 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:56,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:56,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:56,437 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1773]. (let ((.cse0 (select v_main_a_1773 main_x))) (let ((.cse1 (= (store v_main_a_1773 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 982 (select v_main_a_1773 main_y)) (= .cse0 18) .cse1)))) [2019-05-15 10:36:56,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:36:56,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:56,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:56,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:56,544 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,570 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:56,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:56,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:56,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1774]. (let ((.cse0 (select v_main_a_1774 main_y))) (let ((.cse2 (select v_main_a_1774 main_x)) (.cse1 (= (store v_main_a_1774 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 982) .cse1 (= .cse2 19)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:36:56,612 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:36:56,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:56,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:56,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:56,719 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,746 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:56,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:56,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:56,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1775]. (let ((.cse1 (select v_main_a_1775 main_x))) (let ((.cse0 (= (store v_main_a_1775 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1775 main_y) 981) .cse0 (= .cse1 19)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:36:56,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:36:56,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:56,874 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:56,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:56,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,926 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:56,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:56,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:57,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1776]. (let ((.cse0 (select v_main_a_1776 main_y))) (let ((.cse1 (select v_main_a_1776 main_x)) (.cse2 (= (store v_main_a_1776 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 981) (= .cse1 20) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:36:57,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:57,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:57,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:57,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:57,153 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,179 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:57,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:57,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:57,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1777]. (let ((.cse1 (select v_main_a_1777 main_x))) (let ((.cse0 (= main_a (store v_main_a_1777 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 20) (= (select v_main_a_1777 main_y) 980)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:36:57,188 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:36:57,276 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:57,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:57,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:57,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:57,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,329 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:57,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:57,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:57,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1778]. (let ((.cse2 (select v_main_a_1778 main_y))) (let ((.cse0 (= main_a (store v_main_a_1778 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1778 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 980) .cse0 (= .cse1 21))))) [2019-05-15 10:36:57,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:36:57,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:57,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:57,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:36:57,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,570 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:57,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:57,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:57,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1779]. (let ((.cse0 (select v_main_a_1779 main_x))) (let ((.cse1 (= (store v_main_a_1779 main_x (+ .cse0 1)) main_a))) (or (and (= 21 .cse0) .cse1 (= 979 (select v_main_a_1779 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:36:57,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:36:57,668 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:36:57,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:57,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:57,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:57,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,721 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:57,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:57,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:57,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1780]. (let ((.cse2 (select v_main_a_1780 main_y))) (let ((.cse0 (= (store v_main_a_1780 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1780 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 22 .cse1) (= 979 .cse2))))) [2019-05-15 10:36:57,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:36:57,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:57,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:57,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,108 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:36:58,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:58,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,554 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:36:58,555 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:58,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:58,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:58,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1781]. (let ((.cse1 (select v_main_a_1781 main_x))) (let ((.cse0 (= (store v_main_a_1781 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 22) .cse0 (= 978 (select v_main_a_1781 main_y)))))) [2019-05-15 10:36:58,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:36:59,821 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-15 10:36:59,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:36:59,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:36:59,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:36:59,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,911 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:36:59,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:36:59,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:36:59,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1782]. (let ((.cse1 (select v_main_a_1782 main_y))) (let ((.cse0 (select v_main_a_1782 main_x)) (.cse2 (= (store v_main_a_1782 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 23) (= .cse1 978) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:36:59,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:00,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:00,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:00,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:00,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,109 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:00,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:00,109 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:00,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1783]. (let ((.cse0 (select v_main_a_1783 main_x))) (let ((.cse1 (= (store v_main_a_1783 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 23) .cse1 (= (select v_main_a_1783 main_y) 977))))) [2019-05-15 10:37:00,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:37:00,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:00,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:00,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:00,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,269 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:00,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:00,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:00,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1784]. (let ((.cse0 (select v_main_a_1784 main_y))) (let ((.cse1 (select v_main_a_1784 main_x)) (.cse2 (= (store v_main_a_1784 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 977) (= .cse1 24) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:37:00,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:00,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:00,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:00,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:00,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,486 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:00,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:00,487 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:00,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1785]. (let ((.cse1 (select v_main_a_1785 main_x))) (let ((.cse0 (= (store v_main_a_1785 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1785 main_y) 976) .cse0 (= .cse1 24)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:37:00,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:37:00,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:00,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:00,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:00,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:00,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,646 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:00,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:00,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:00,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1786]. (let ((.cse2 (select v_main_a_1786 main_y))) (let ((.cse0 (= (store v_main_a_1786 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1786 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 976 .cse2) (= 25 .cse1))))) [2019-05-15 10:37:00,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:00,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:00,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:00,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:00,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,829 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:00,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:00,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:00,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1787]. (let ((.cse1 (select v_main_a_1787 main_x))) (let ((.cse0 (= (store v_main_a_1787 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1787 main_y) 975) (= .cse1 25))))) [2019-05-15 10:37:00,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:37:00,929 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:00,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:00,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:00,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,951 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:00,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,979 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:00,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:00,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:01,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1788]. (let ((.cse2 (select v_main_a_1788 main_y))) (let ((.cse0 (select v_main_a_1788 main_x)) (.cse1 (= (store v_main_a_1788 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 26) (= .cse2 975) .cse1)))) [2019-05-15 10:37:01,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:01,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:01,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:01,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:01,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,169 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:01,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:01,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:01,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,182 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1789]. (let ((.cse0 (select v_main_a_1789 main_x))) (let ((.cse1 (= main_a (store v_main_a_1789 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 26 .cse0) (= (select v_main_a_1789 main_y) 974))))) [2019-05-15 10:37:01,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:37:01,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:01,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:01,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:01,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:01,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,323 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:01,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:01,323 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:01,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1790]. (let ((.cse2 (select v_main_a_1790 main_y))) (let ((.cse0 (= (store v_main_a_1790 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1790 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 974) .cse0 (= .cse1 27))))) [2019-05-15 10:37:01,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:01,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:01,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:01,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,539 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:01,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,567 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:01,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:01,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:01,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1791]. (let ((.cse0 (select v_main_a_1791 main_x))) (let ((.cse1 (= main_a (store v_main_a_1791 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1791 main_y) 973) .cse1 (= .cse0 27))))) [2019-05-15 10:37:01,580 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:37:01,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:01,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:01,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:01,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:01,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,719 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:01,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:01,720 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:01,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1792]. (let ((.cse2 (select v_main_a_1792 main_y))) (let ((.cse0 (= (store v_main_a_1792 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1792 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 973) (= .cse1 28))))) [2019-05-15 10:37:01,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:01,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:01,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:01,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:01,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,934 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:01,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:01,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:01,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1793]. (let ((.cse1 (select v_main_a_1793 main_x))) (let ((.cse0 (= main_a (store v_main_a_1793 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1793 main_y) 972) (= .cse1 28)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:37:01,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:37:02,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:02,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:02,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:02,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:02,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:02,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,086 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:02,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:02,086 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:02,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:02,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1794]. (let ((.cse2 (select v_main_a_1794 main_y))) (let ((.cse0 (= (store v_main_a_1794 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1794 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 29) (= .cse2 972))))) [2019-05-15 10:37:02,168 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:02,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:02,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:02,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:02,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:02,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,329 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:02,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:02,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:02,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:02,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1795]. (let ((.cse1 (select v_main_a_1795 main_x))) (let ((.cse0 (= (store v_main_a_1795 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 29) (= (select v_main_a_1795 main_y) 971)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:37:02,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:37:02,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:02,459 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:02,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:02,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:02,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,502 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:02,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:02,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:02,570 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:02,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1796]. (let ((.cse1 (select v_main_a_1796 main_y))) (let ((.cse0 (select v_main_a_1796 main_x)) (.cse2 (= (store v_main_a_1796 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 30 .cse0) (= .cse1 971) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:37:02,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:02,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:02,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:02,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:02,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:02,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,728 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:02,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:02,729 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:02,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:02,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1797]. (let ((.cse0 (select v_main_a_1797 main_x))) (let ((.cse1 (= (store v_main_a_1797 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1797 main_y) 970) (= .cse0 30) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:37:02,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:37:02,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:02,855 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:02,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:02,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:02,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:02,897 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:02,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:02,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:02,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:02,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1798]. (let ((.cse1 (select v_main_a_1798 main_y))) (let ((.cse0 (select v_main_a_1798 main_x)) (.cse2 (= (store v_main_a_1798 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 31) (= .cse1 970) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:37:02,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:03,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:03,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:03,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,046 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:03,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:03,048 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,083 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:03,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:03,084 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:03,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:03,097 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1799]. (let ((.cse0 (select v_main_a_1799 main_x))) (let ((.cse1 (= main_a (store v_main_a_1799 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 31 .cse0) (= (select v_main_a_1799 main_y) 969))))) [2019-05-15 10:37:03,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:37:03,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:03,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:03,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:03,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:03,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:03,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,246 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:03,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:03,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:03,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:03,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1800]. (let ((.cse2 (select v_main_a_1800 main_y))) (let ((.cse1 (select v_main_a_1800 main_x)) (.cse0 (= (store v_main_a_1800 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 32) (= .cse2 969) .cse0)))) [2019-05-15 10:37:03,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:03,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:03,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:03,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:03,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:03,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,477 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:03,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:03,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:03,490 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:03,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1801]. (let ((.cse1 (select v_main_a_1801 main_x))) (let ((.cse0 (= (store v_main_a_1801 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1801 main_y) 968) (= .cse1 32))))) [2019-05-15 10:37:03,490 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:37:03,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:03,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:03,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:03,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,614 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:03,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:03,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,641 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:03,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:03,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:03,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:03,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1802]. (let ((.cse2 (select v_main_a_1802 main_y))) (let ((.cse0 (= (store v_main_a_1802 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1802 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= .cse2 968) (= 33 .cse1))))) [2019-05-15 10:37:03,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:03,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:03,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:03,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:03,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:03,835 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:03,871 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:03,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:03,871 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:03,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:03,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1803]. (let ((.cse0 (select v_main_a_1803 main_x))) (let ((.cse1 (= (store v_main_a_1803 main_x (+ .cse0 1)) main_a))) (or (and (= 33 .cse0) .cse1 (= 967 (select v_main_a_1803 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:37:03,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:37:03,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:04,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:04,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:04,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:04,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,053 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:04,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:04,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:04,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:04,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1804]. (let ((.cse0 (select v_main_a_1804 main_y))) (let ((.cse1 (= (store v_main_a_1804 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1804 main_x))) (or (and (= 967 .cse0) .cse1 (= 34 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:37:04,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:04,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:04,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:04,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,251 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:04,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:04,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,289 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:04,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:04,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:04,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:04,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1805]. (let ((.cse0 (select v_main_a_1805 main_x))) (let ((.cse1 (= (store v_main_a_1805 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 34) (= 966 (select v_main_a_1805 main_y)) .cse1)))) [2019-05-15 10:37:04,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:37:04,409 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:04,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:04,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:04,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,431 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:04,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:04,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,458 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:04,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:04,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:04,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:04,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1806]. (let ((.cse2 (select v_main_a_1806 main_y))) (let ((.cse0 (select v_main_a_1806 main_x)) (.cse1 (= (store v_main_a_1806 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= 966 .cse2) (= .cse0 35) .cse1)))) [2019-05-15 10:37:04,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:37:04,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:04,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:04,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:04,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:04,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,631 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:04,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:04,631 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:04,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:04,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1807]. (let ((.cse1 (select v_main_a_1807 main_x))) (let ((.cse0 (= (store v_main_a_1807 main_x (+ .cse1 1)) main_a))) (or (and (= 965 (select v_main_a_1807 main_y)) .cse0 (= 35 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:37:04,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:37:04,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:04,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:04,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:04,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:04,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:04,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,803 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:04,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:04,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:04,815 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:04,815 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1808]. (let ((.cse2 (select v_main_a_1808 main_y))) (let ((.cse1 (= (store v_main_a_1808 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1808 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 36) (= .cse2 965))))) [2019-05-15 10:37:04,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:37:04,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:04,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:04,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:04,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:04,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:04,976 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:04,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:04,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:04,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:04,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1809]. (let ((.cse0 (select v_main_a_1809 main_x))) (let ((.cse1 (= (store v_main_a_1809 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 36) .cse1 (= (select v_main_a_1809 main_y) 964)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:37:04,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:37:05,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:05,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:05,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:05,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,126 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:05,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:05,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,153 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:05,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:05,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:05,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:05,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1810]. (let ((.cse2 (select v_main_a_1810 main_y))) (let ((.cse0 (select v_main_a_1810 main_x)) (.cse1 (= (store v_main_a_1810 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 37) .cse1 (= 964 .cse2))))) [2019-05-15 10:37:05,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:05,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:05,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:05,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:05,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:05,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,376 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:05,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:05,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:05,388 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:05,388 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1811]. (let ((.cse0 (select v_main_a_1811 main_x))) (let ((.cse1 (= (store v_main_a_1811 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 37) (= 963 (select v_main_a_1811 main_y)) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:37:05,388 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:37:05,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:05,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:05,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:05,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:05,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,558 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:05,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:05,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:05,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:05,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1812]. (let ((.cse1 (select v_main_a_1812 main_y))) (let ((.cse2 (= (store v_main_a_1812 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1812 main_x))) (or (and (= .cse0 38) (= .cse1 963) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:37:05,648 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:37:05,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:05,789 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:05,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:05,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:05,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,832 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:05,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:05,833 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:05,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:05,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1813]. (let ((.cse0 (select v_main_a_1813 main_x))) (let ((.cse1 (= (store v_main_a_1813 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1813 main_y) 962) (= .cse0 38) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:37:05,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:37:05,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:05,978 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:05,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:05,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:05,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:05,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,011 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:06,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:06,011 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:06,065 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:06,066 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1814]. (let ((.cse2 (select v_main_a_1814 main_y))) (let ((.cse0 (= (store v_main_a_1814 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1814 main_x))) (or (and .cse0 (= 39 .cse1) (= .cse2 962)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:37:06,066 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:06,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:06,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:06,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:06,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:06,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,239 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:06,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:06,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:06,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:06,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1815]. (let ((.cse0 (select v_main_a_1815 main_x))) (let ((.cse1 (= (store v_main_a_1815 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1815 main_y) 961) (= .cse0 39) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:37:06,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 961) (= .cse0 40)))) [2019-05-15 10:37:06,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:06,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:06,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:06,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,392 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:06,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:06,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,420 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:06,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:06,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:06,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:06,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1816]. (let ((.cse2 (select v_main_a_1816 main_y))) (let ((.cse0 (select v_main_a_1816 main_x)) (.cse1 (= main_a (store v_main_a_1816 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 40 .cse0) (= .cse2 961) .cse1)))) [2019-05-15 10:37:06,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:06,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:06,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:06,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,655 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:06,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:06,657 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,693 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:06,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:06,694 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:06,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:06,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1817]. (let ((.cse1 (select v_main_a_1817 main_x))) (let ((.cse0 (= (store v_main_a_1817 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 960 (select v_main_a_1817 main_y)) (= 40 .cse1))))) [2019-05-15 10:37:06,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 41) (= (select main_a main_y) 960)))) [2019-05-15 10:37:06,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:06,853 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:06,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:06,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:06,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:06,899 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:06,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:06,899 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:06,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:06,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1818]. (let ((.cse1 (select v_main_a_1818 main_y))) (let ((.cse2 (= main_a (store v_main_a_1818 main_y (+ .cse1 (- 1))))) (.cse0 (select v_main_a_1818 main_x))) (or (and (= 41 .cse0) (= .cse1 960) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse0))))) [2019-05-15 10:37:06,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 959) (= .cse0 41)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:07,138 INFO L273 TraceCheckUtils]: 0: Hoare triple {14898#true} a := a[x := 0]; {14903#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:37:07,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {14903#(= (select main_a main_x) 0)} a := a[y := 1000]; {14907#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:37:07,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {14907#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {14911#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:37:07,142 INFO L273 TraceCheckUtils]: 3: Hoare triple {14911#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {14915#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,143 INFO L273 TraceCheckUtils]: 4: Hoare triple {14915#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14919#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:37:07,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {14919#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {14923#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {14923#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14927#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:37:07,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {14927#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {14931#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {14931#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14935#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:37:07,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {14935#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {14939#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {14939#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14943#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:37:07,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {14943#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {14947#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {14947#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14951#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:37:07,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {14951#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {14955#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:37:07,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {14955#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {14959#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:37:07,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {14959#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {14963#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:37:07,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {14963#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {14967#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:37:07,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {14967#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {14971#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:37:07,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {14971#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {14975#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:37:07,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {14975#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {14979#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {14979#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14983#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:37:07,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {14983#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {14987#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {14987#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {14991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:37:07,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {14991#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {14995#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:37:07,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {14995#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {14999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:37:07,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {14999#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {15003#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,169 INFO L273 TraceCheckUtils]: 26: Hoare triple {15003#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:37:07,170 INFO L273 TraceCheckUtils]: 27: Hoare triple {15007#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {15011#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {15011#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:37:07,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {15015#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {15019#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:37:07,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {15019#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {15023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:37:07,174 INFO L273 TraceCheckUtils]: 31: Hoare triple {15023#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {15027#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {15027#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:37:07,177 INFO L273 TraceCheckUtils]: 33: Hoare triple {15031#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {15035#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {15035#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:37:07,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {15039#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {15043#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:37:07,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {15043#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {15047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:37:07,181 INFO L273 TraceCheckUtils]: 37: Hoare triple {15047#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {15051#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,182 INFO L273 TraceCheckUtils]: 38: Hoare triple {15051#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:37:07,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {15055#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {15059#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:37:07,184 INFO L273 TraceCheckUtils]: 40: Hoare triple {15059#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {15063#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:37:07,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {15063#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {15067#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,187 INFO L273 TraceCheckUtils]: 42: Hoare triple {15067#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15071#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:37:07,188 INFO L273 TraceCheckUtils]: 43: Hoare triple {15071#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {15075#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {15075#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15079#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:37:07,190 INFO L273 TraceCheckUtils]: 45: Hoare triple {15079#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {15083#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:37:07,191 INFO L273 TraceCheckUtils]: 46: Hoare triple {15083#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {15087#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:37:07,193 INFO L273 TraceCheckUtils]: 47: Hoare triple {15087#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {15091#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {15091#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15095#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:37:07,195 INFO L273 TraceCheckUtils]: 49: Hoare triple {15095#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {15099#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,196 INFO L273 TraceCheckUtils]: 50: Hoare triple {15099#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15103#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:37:07,197 INFO L273 TraceCheckUtils]: 51: Hoare triple {15103#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {15107#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,198 INFO L273 TraceCheckUtils]: 52: Hoare triple {15107#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15111#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:37:07,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {15111#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {15115#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,200 INFO L273 TraceCheckUtils]: 54: Hoare triple {15115#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15119#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:37:07,202 INFO L273 TraceCheckUtils]: 55: Hoare triple {15119#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {15123#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,203 INFO L273 TraceCheckUtils]: 56: Hoare triple {15123#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15127#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:37:07,204 INFO L273 TraceCheckUtils]: 57: Hoare triple {15127#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {15131#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,205 INFO L273 TraceCheckUtils]: 58: Hoare triple {15131#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15135#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:37:07,206 INFO L273 TraceCheckUtils]: 59: Hoare triple {15135#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {15139#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,207 INFO L273 TraceCheckUtils]: 60: Hoare triple {15139#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15143#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:37:07,208 INFO L273 TraceCheckUtils]: 61: Hoare triple {15143#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {15147#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,210 INFO L273 TraceCheckUtils]: 62: Hoare triple {15147#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15151#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:37:07,211 INFO L273 TraceCheckUtils]: 63: Hoare triple {15151#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {15155#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,212 INFO L273 TraceCheckUtils]: 64: Hoare triple {15155#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15159#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:37:07,213 INFO L273 TraceCheckUtils]: 65: Hoare triple {15159#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {15163#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,214 INFO L273 TraceCheckUtils]: 66: Hoare triple {15163#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15167#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:37:07,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {15167#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {15171#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {15171#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15175#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:37:07,218 INFO L273 TraceCheckUtils]: 69: Hoare triple {15175#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {15179#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:37:07,219 INFO L273 TraceCheckUtils]: 70: Hoare triple {15179#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {15183#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:37:07,220 INFO L273 TraceCheckUtils]: 71: Hoare triple {15183#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {15187#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:37:07,221 INFO L273 TraceCheckUtils]: 72: Hoare triple {15187#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {15191#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:37:07,222 INFO L273 TraceCheckUtils]: 73: Hoare triple {15191#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {15195#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:37:07,223 INFO L273 TraceCheckUtils]: 74: Hoare triple {15195#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {15199#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:37:07,224 INFO L273 TraceCheckUtils]: 75: Hoare triple {15199#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {15203#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,226 INFO L273 TraceCheckUtils]: 76: Hoare triple {15203#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15207#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:37:07,227 INFO L273 TraceCheckUtils]: 77: Hoare triple {15207#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {15211#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:37:07,228 INFO L273 TraceCheckUtils]: 78: Hoare triple {15211#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {15215#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:37:07,229 INFO L273 TraceCheckUtils]: 79: Hoare triple {15215#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {15219#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,230 INFO L273 TraceCheckUtils]: 80: Hoare triple {15219#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15223#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} is VALID [2019-05-15 10:37:07,231 INFO L273 TraceCheckUtils]: 81: Hoare triple {15223#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} a := a[y := a[y] - 1]; {15227#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,233 INFO L273 TraceCheckUtils]: 82: Hoare triple {15227#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15231#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} is VALID [2019-05-15 10:37:07,234 INFO L273 TraceCheckUtils]: 83: Hoare triple {15231#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} a := a[y := a[y] - 1]; {15235#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:07,234 INFO L273 TraceCheckUtils]: 84: Hoare triple {15235#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {14899#false} is VALID [2019-05-15 10:37:07,235 INFO L273 TraceCheckUtils]: 85: Hoare triple {14899#false} assume !(a[y] <= 0); {14899#false} is VALID [2019-05-15 10:37:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:07,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:07,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-15 10:37:07,263 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-05-15 10:37:07,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:07,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states. [2019-05-15 10:37:07,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:07,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-05-15 10:37:07,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-15 10:37:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-05-15 10:37:07,404 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-05-15 10:37:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:25,764 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:37:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-15 10:37:25,765 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-05-15 10:37:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:37:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-05-15 10:37:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-05-15 10:37:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-05-15 10:37:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-05-15 10:37:25,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2019-05-15 10:37:25,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:25,892 INFO L225 Difference]: With dead ends: 89 [2019-05-15 10:37:25,892 INFO L226 Difference]: Without dead ends: 89 [2019-05-15 10:37:25,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-05-15 10:37:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-05-15 10:37:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-05-15 10:37:25,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:37:25,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2019-05-15 10:37:25,894 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2019-05-15 10:37:25,894 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2019-05-15 10:37:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:25,896 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:37:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:37:25,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:25,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:25,896 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2019-05-15 10:37:25,896 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2019-05-15 10:37:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:25,897 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:37:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:37:25,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:25,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:25,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:37:25,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:37:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-05-15 10:37:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-05-15 10:37:25,899 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-05-15 10:37:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:37:25,900 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-05-15 10:37:25,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-05-15 10:37:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:37:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-05-15 10:37:25,900 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:37:25,900 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-05-15 10:37:25,900 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:37:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:37:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1915493331, now seen corresponding path program 42 times [2019-05-15 10:37:25,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:37:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:26,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-15 10:37:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:26,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:37:26,115 INFO L375 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 6 treesize of output 5 [2019-05-15 10:37:26,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:37:26,118 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1819]. (= main_a (store v_main_a_1819 main_x 0)) [2019-05-15 10:37:26,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:37:26,138 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:37:26,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,152 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:37:26,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:37:26,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1820]. (and (= (store v_main_a_1820 main_y 1000) main_a) (= (select v_main_a_1820 main_x) 0)) [2019-05-15 10:37:26,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:37:26,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:26,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:26,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:26,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:26,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,224 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:26,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:26,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:26,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1821]. (let ((.cse2 (select v_main_a_1821 main_x))) (let ((.cse0 (= 1000 (select v_main_a_1821 main_y))) (.cse1 (= (store v_main_a_1821 main_x (+ .cse2 1)) main_a))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= 0 .cse2))))) [2019-05-15 10:37:26,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:37:26,264 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:26,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:26,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:26,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:26,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,311 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:26,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:26,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:26,359 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,359 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1822]. (let ((.cse2 (select v_main_a_1822 main_y))) (let ((.cse0 (select v_main_a_1822 main_x)) (.cse1 (= (store v_main_a_1822 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 1) (= .cse2 1000) .cse1)))) [2019-05-15 10:37:26,359 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:26,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:26,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:26,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:26,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,448 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:26,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:26,449 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:26,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,459 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1823]. (let ((.cse0 (select v_main_a_1823 main_x))) (let ((.cse1 (= main_a (store v_main_a_1823 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= (select v_main_a_1823 main_y) 999) (= .cse0 1))))) [2019-05-15 10:37:26,459 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:37:26,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:26,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:26,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:26,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:26,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,548 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:26,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:26,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:26,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1824]. (let ((.cse2 (select v_main_a_1824 main_y))) (let ((.cse0 (select v_main_a_1824 main_x)) (.cse1 (= (store v_main_a_1824 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 2) .cse1 (= .cse2 999))))) [2019-05-15 10:37:26,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:26,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:26,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:26,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:26,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,669 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:26,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:26,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:26,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1825]. (let ((.cse1 (select v_main_a_1825 main_x))) (let ((.cse0 (= (store v_main_a_1825 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= .cse1 2) (= (select v_main_a_1825 main_y) 998))))) [2019-05-15 10:37:26,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:37:26,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:26,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:26,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:26,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:26,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,765 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:26,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:26,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:26,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1826]. (let ((.cse2 (select v_main_a_1826 main_y))) (let ((.cse1 (= main_a (store v_main_a_1826 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1826 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 998 .cse2) .cse1 (= 3 .cse0))))) [2019-05-15 10:37:26,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:26,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:26,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:26,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,859 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:26,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,886 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:26,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:26,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:26,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:26,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1827]. (let ((.cse1 (select v_main_a_1827 main_x))) (let ((.cse0 (= (store v_main_a_1827 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 997 (select v_main_a_1827 main_y)) (= .cse1 3) .cse0)))) [2019-05-15 10:37:26,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:37:26,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:26,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:26,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:26,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:26,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:26,959 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:26,984 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:26,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:26,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:27,015 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:27,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1828]. (let ((.cse2 (select v_main_a_1828 main_y))) (let ((.cse0 (= main_a (store v_main_a_1828 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1828 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 4) (= 997 .cse2))))) [2019-05-15 10:37:27,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:27,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:27,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:27,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:27,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:27,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,110 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:27,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:27,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:27,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:27,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1829]. (let ((.cse0 (select v_main_a_1829 main_x))) (let ((.cse1 (= main_a (store v_main_a_1829 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 4) (= (select v_main_a_1829 main_y) 996))))) [2019-05-15 10:37:27,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:37:27,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:27,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:27,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:27,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:27,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,210 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:27,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:27,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:27,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:27,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1830]. (let ((.cse0 (select v_main_a_1830 main_y))) (let ((.cse2 (= (store v_main_a_1830 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1830 main_x))) (or (and (= 996 .cse0) (= 5 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:37:27,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:27,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:27,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:27,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:27,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:27,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,329 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:27,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:27,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:27,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:27,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1831]. (let ((.cse0 (select v_main_a_1831 main_x))) (let ((.cse1 (= main_a (store v_main_a_1831 main_x (+ .cse0 1))))) (or (and (= .cse0 5) .cse1 (= (select v_main_a_1831 main_y) 995)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:37:27,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:37:27,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:27,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:27,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:27,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,406 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:27,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:27,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,444 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:27,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:27,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:27,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:27,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1832]. (let ((.cse2 (select v_main_a_1832 main_y))) (let ((.cse0 (= (store v_main_a_1832 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1832 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 6) (= .cse2 995))))) [2019-05-15 10:37:27,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:27,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:27,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:27,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:27,848 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-05-15 10:37:27,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:27,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:27,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,022 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-05-15 10:37:28,022 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1833]. (let ((.cse0 (select v_main_a_1833 main_x))) (let ((.cse1 (= (store v_main_a_1833 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 994 (select v_main_a_1833 main_y)) (= 6 .cse0) .cse1)))) [2019-05-15 10:37:28,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:37:28,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:28,096 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:28,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:28,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:28,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,128 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1834]. (let ((.cse2 (select v_main_a_1834 main_y))) (let ((.cse0 (select v_main_a_1834 main_x)) (.cse1 (= (store v_main_a_1834 main_y (+ .cse2 (- 1))) main_a))) (or (and (= 7 .cse0) .cse1 (= 994 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:37:28,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:37:28,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:28,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:28,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:28,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:28,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,232 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1835]. (let ((.cse0 (select v_main_a_1835 main_x))) (let ((.cse1 (= (store v_main_a_1835 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 7) (= 993 (select v_main_a_1835 main_y)) .cse1)))) [2019-05-15 10:37:28,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:37:28,294 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:28,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:28,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:28,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,316 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:28,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:28,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,343 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,343 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,355 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,355 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1836]. (let ((.cse2 (select v_main_a_1836 main_y))) (let ((.cse0 (= main_a (store v_main_a_1836 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1836 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 8) (= .cse2 993))))) [2019-05-15 10:37:28,355 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:37:28,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:28,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:28,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:28,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:28,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,456 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1837]. (let ((.cse0 (select v_main_a_1837 main_x))) (let ((.cse1 (= main_a (store v_main_a_1837 main_x (+ .cse0 1))))) (or (and (= 8 .cse0) .cse1 (= (select v_main_a_1837 main_y) 992)) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:37:28,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:37:28,518 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:28,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:28,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:28,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:28,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:28,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,568 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1838]. (let ((.cse2 (select v_main_a_1838 main_y))) (let ((.cse0 (select v_main_a_1838 main_x)) (.cse1 (= (store v_main_a_1838 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 992 .cse2) (= 9 .cse0) .cse1)))) [2019-05-15 10:37:28,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:37:28,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:28,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:28,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:28,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:28,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,689 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1839]. (let ((.cse1 (select v_main_a_1839 main_x))) (let ((.cse0 (= (store v_main_a_1839 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1839 main_y) 991) .cse0 (= 9 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:37:28,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:37:28,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:28,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:28,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:28,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:28,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:28,777 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,802 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,823 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1840]. (let ((.cse2 (select v_main_a_1840 main_y))) (let ((.cse1 (select v_main_a_1840 main_x)) (.cse0 (= main_a (store v_main_a_1840 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 991) (= .cse1 10) .cse0)))) [2019-05-15 10:37:28,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:28,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:28,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:28,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:28,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:28,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:28,926 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:28,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:28,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:28,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:28,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1841]. (let ((.cse1 (select v_main_a_1841 main_x))) (let ((.cse0 (= (store v_main_a_1841 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 10) (= (select v_main_a_1841 main_y) 990)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:37:28,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:37:28,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:29,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:29,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:29,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:29,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,043 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:29,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:29,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:29,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:29,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1842]. (let ((.cse0 (select v_main_a_1842 main_y))) (let ((.cse2 (= main_a (store v_main_a_1842 main_y (+ .cse0 (- 1))))) (.cse1 (select v_main_a_1842 main_x))) (or (and (= .cse0 990) (= 11 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:37:29,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:37:29,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:29,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:29,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:29,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:29,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,160 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:29,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:29,161 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:29,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:29,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1843]. (let ((.cse0 (select v_main_a_1843 main_x))) (let ((.cse1 (= (store v_main_a_1843 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 11) (= (select v_main_a_1843 main_y) 989) .cse1)))) [2019-05-15 10:37:29,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:37:29,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:29,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:29,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:29,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:29,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:29,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,280 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:29,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:29,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:29,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:29,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1844]. (let ((.cse2 (select v_main_a_1844 main_y))) (let ((.cse1 (select v_main_a_1844 main_x)) (.cse0 (= (store v_main_a_1844 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 12 .cse1) .cse0 (= 989 .cse2))))) [2019-05-15 10:37:29,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:29,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:29,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:29,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:29,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:29,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,415 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:29,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:29,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:29,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:29,427 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1845]. (let ((.cse0 (select v_main_a_1845 main_x))) (let ((.cse1 (= (store v_main_a_1845 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1845 main_y) 988) (= 12 .cse0) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:37:29,427 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:37:29,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:29,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:29,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:29,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:29,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:29,514 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,548 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:29,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:29,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:29,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:29,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1846]. (let ((.cse2 (select v_main_a_1846 main_y))) (let ((.cse0 (= (store v_main_a_1846 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1846 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= 988 .cse2) (= 13 .cse1))))) [2019-05-15 10:37:29,569 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:29,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:29,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:29,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,652 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:29,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:29,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,680 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:29,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:29,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:29,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:29,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1847]. (let ((.cse0 (select v_main_a_1847 main_x))) (let ((.cse1 (= (store v_main_a_1847 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1847 main_y) 987) (= .cse0 13) .cse1)))) [2019-05-15 10:37:29,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:37:29,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:29,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:29,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:29,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:29,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:29,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,886 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:29,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:29,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:29,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:29,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1848]. (let ((.cse2 (select v_main_a_1848 main_y))) (let ((.cse1 (select v_main_a_1848 main_x)) (.cse0 (= (store v_main_a_1848 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 14) (= .cse2 987) .cse0)))) [2019-05-15 10:37:29,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:37:29,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:29,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:29,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:29,988 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:29,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:29,990 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,015 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:30,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:30,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:30,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:30,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1849]. (let ((.cse0 (select v_main_a_1849 main_x))) (let ((.cse1 (= (store v_main_a_1849 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1849 main_y) 986) (= .cse0 14) .cse1)))) [2019-05-15 10:37:30,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:37:30,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:30,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:30,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:30,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:30,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,150 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:30,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:30,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:30,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:30,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1850]. (let ((.cse2 (select v_main_a_1850 main_y))) (let ((.cse0 (= (store v_main_a_1850 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1850 main_x))) (or (and .cse0 (= 15 .cse1) (= 986 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:37:30,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:30,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:30,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:30,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:30,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:30,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,328 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:30,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:30,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:30,336 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:30,337 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1851]. (let ((.cse1 (select v_main_a_1851 main_x))) (let ((.cse0 (= (store v_main_a_1851 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1851 main_y) 985) (= .cse1 15)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:37:30,337 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:37:30,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:30,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:30,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:30,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:30,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,469 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:30,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:30,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:30,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:30,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1852]. (let ((.cse2 (select v_main_a_1852 main_y))) (let ((.cse0 (= (store v_main_a_1852 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1852 main_x))) (or (and .cse0 (= .cse1 16) (= .cse2 985)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:37:30,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:30,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:30,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:30,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:30,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:30,607 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,633 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:30,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:30,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:30,644 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:30,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1853]. (let ((.cse0 (select v_main_a_1853 main_x))) (let ((.cse1 (= (store v_main_a_1853 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1853 main_y) 984) (= .cse0 16) .cse1)))) [2019-05-15 10:37:30,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:37:30,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:30,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:30,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:30,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:30,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,772 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:30,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:30,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:30,781 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:30,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1854]. (let ((.cse1 (select v_main_a_1854 main_y))) (let ((.cse0 (= main_a (store v_main_a_1854 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_1854 main_x))) (or (and .cse0 (= 984 .cse1) (= 17 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:37:30,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:37:30,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:30,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:30,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,874 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:30,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:30,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:30,902 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:30,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:30,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:30,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:30,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1855]. (let ((.cse1 (select v_main_a_1855 main_x))) (let ((.cse0 (= (store v_main_a_1855 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 17) (= (select v_main_a_1855 main_y) 983) .cse0)))) [2019-05-15 10:37:30,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:37:30,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:30,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:30,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:30,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:31,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:31,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,055 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:31,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:31,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:31,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:31,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1856]. (let ((.cse2 (select v_main_a_1856 main_y))) (let ((.cse1 (= (store v_main_a_1856 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1856 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 18 .cse0) (= .cse2 983))))) [2019-05-15 10:37:31,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:31,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:31,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:31,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:31,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:31,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,227 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:31,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:31,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:31,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:31,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1857]. (let ((.cse1 (select v_main_a_1857 main_x))) (let ((.cse0 (= (store v_main_a_1857 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_1857 main_y) 982) (= 18 .cse1))))) [2019-05-15 10:37:31,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:37:31,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:31,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:31,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:31,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:31,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:31,348 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,373 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:31,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:31,373 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:31,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:31,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1858]. (let ((.cse2 (select v_main_a_1858 main_y))) (let ((.cse0 (select v_main_a_1858 main_x)) (.cse1 (= (store v_main_a_1858 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 982 .cse2) (= 19 .cse0) .cse1)))) [2019-05-15 10:37:31,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:37:31,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:31,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:31,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:31,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:31,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,513 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:31,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:31,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:31,525 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:31,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1859]. (let ((.cse1 (select v_main_a_1859 main_x))) (let ((.cse0 (= (store v_main_a_1859 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1859 main_y) 981) .cse0 (= .cse1 19)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:37:31,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:37:31,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:31,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:31,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:31,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:31,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:31,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,665 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:31,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:31,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:31,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:31,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1860]. (let ((.cse2 (select v_main_a_1860 main_y))) (let ((.cse0 (= (store v_main_a_1860 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1860 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 20) (= .cse2 981))))) [2019-05-15 10:37:31,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:31,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:31,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:31,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:31,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:31,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,838 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:31,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:31,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:31,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:31,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1861]. (let ((.cse1 (select v_main_a_1861 main_x))) (let ((.cse0 (= (store v_main_a_1861 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 20) .cse0 (= (select v_main_a_1861 main_y) 980))))) [2019-05-15 10:37:31,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:37:31,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:31,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:31,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:31,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:31,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:31,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:31,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,014 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:32,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:32,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:32,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1862]. (let ((.cse2 (select v_main_a_1862 main_y))) (let ((.cse1 (= main_a (store v_main_a_1862 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1862 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 21 .cse0) (= .cse2 980))))) [2019-05-15 10:37:32,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:32,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:32,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:32,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:32,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,218 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:32,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:32,218 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:32,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1863]. (let ((.cse0 (select v_main_a_1863 main_x))) (let ((.cse1 (= (store v_main_a_1863 main_x (+ .cse0 1)) main_a))) (or (and (= 21 .cse0) (= (select v_main_a_1863 main_y) 979) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:37:32,234 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:37:32,311 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:32,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:32,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:32,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:32,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,369 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:32,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:32,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:32,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1864]. (let ((.cse2 (select v_main_a_1864 main_y))) (let ((.cse0 (select v_main_a_1864 main_x)) (.cse1 (= main_a (store v_main_a_1864 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 22 .cse0) (= .cse2 979) .cse1)))) [2019-05-15 10:37:32,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:37:32,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:32,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:32,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:32,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,501 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:32,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:32,501 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:32,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1865]. (let ((.cse0 (select v_main_a_1865 main_x))) (let ((.cse1 (= main_a (store v_main_a_1865 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1865 main_y) 978) .cse1 (= .cse0 22))))) [2019-05-15 10:37:32,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:37:32,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:32,612 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:32,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:32,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,654 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:32,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:32,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:32,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1866]. (let ((.cse1 (select v_main_a_1866 main_y))) (let ((.cse0 (select v_main_a_1866 main_x)) (.cse2 (= (store v_main_a_1866 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 23 .cse0) (= .cse1 978) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:37:32,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:32,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:32,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:32,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:32,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,878 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:32,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:32,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:32,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1867]. (let ((.cse1 (select v_main_a_1867 main_x))) (let ((.cse0 (= (store v_main_a_1867 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 23) .cse0 (= (select v_main_a_1867 main_y) 977))))) [2019-05-15 10:37:32,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:37:32,972 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:32,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:32,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:32,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:32,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,017 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:33,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:33,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:33,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1868]. (let ((.cse2 (select v_main_a_1868 main_y))) (let ((.cse0 (= main_a (store v_main_a_1868 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1868 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 977) (= .cse1 24))))) [2019-05-15 10:37:33,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:33,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:33,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:33,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:33,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,211 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:33,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:33,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:33,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1869]. (let ((.cse1 (select v_main_a_1869 main_x))) (let ((.cse0 (= main_a (store v_main_a_1869 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 24) (= 976 (select v_main_a_1869 main_y)))))) [2019-05-15 10:37:33,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:37:33,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:33,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:33,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:33,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:33,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,354 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:33,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:33,355 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:33,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1870]. (let ((.cse2 (select v_main_a_1870 main_y))) (let ((.cse0 (= (store v_main_a_1870 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1870 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= .cse2 976) .cse0 (= 25 .cse1))))) [2019-05-15 10:37:33,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:33,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:33,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:33,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:33,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,583 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:33,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:33,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:33,595 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,595 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1871]. (let ((.cse0 (select v_main_a_1871 main_x))) (let ((.cse1 (= (store v_main_a_1871 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1871 main_y) 975) .cse1 (= .cse0 25))))) [2019-05-15 10:37:33,595 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:37:33,684 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:33,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:33,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:33,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:33,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,735 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:33,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:33,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:33,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1872]. (let ((.cse2 (select v_main_a_1872 main_y))) (let ((.cse1 (= main_a (store v_main_a_1872 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1872 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 975) .cse1 (= .cse0 26))))) [2019-05-15 10:37:33,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:33,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:33,884 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:33,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:33,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,918 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:33,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:33,919 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:33,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1873]. (let ((.cse1 (select v_main_a_1873 main_x))) (let ((.cse0 (= (store v_main_a_1873 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 26) (= (select v_main_a_1873 main_y) 974)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:37:33,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:37:34,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:34,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:34,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:34,047 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,073 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:34,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:34,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:34,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1874]. (let ((.cse2 (select v_main_a_1874 main_y))) (let ((.cse0 (select v_main_a_1874 main_x)) (.cse1 (= (store v_main_a_1874 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 27) .cse1 (= .cse2 974)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:37:34,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:34,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:34,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:34,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:34,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,278 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:34,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:34,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:34,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1875]. (let ((.cse1 (select v_main_a_1875 main_x))) (let ((.cse0 (= main_a (store v_main_a_1875 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 27) (= (select v_main_a_1875 main_y) 973)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:37:34,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:37:34,389 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:34,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:34,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:34,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:34,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,445 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:34,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:34,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:34,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,516 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1876]. (let ((.cse2 (select v_main_a_1876 main_y))) (let ((.cse1 (select v_main_a_1876 main_x)) (.cse0 (= (store v_main_a_1876 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 28) .cse0 (= .cse2 973))))) [2019-05-15 10:37:34,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:34,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:34,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:34,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:34,639 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,666 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:34,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:34,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:34,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1877]. (let ((.cse0 (select v_main_a_1877 main_x))) (let ((.cse1 (= main_a (store v_main_a_1877 main_x (+ .cse0 1))))) (or (and (= .cse0 28) (= 972 (select v_main_a_1877 main_y)) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:37:34,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:37:34,775 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:34,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:34,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:34,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:34,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,828 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:34,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:34,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:34,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,927 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1878]. (let ((.cse2 (select v_main_a_1878 main_y))) (let ((.cse0 (= (store v_main_a_1878 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1878 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 972) .cse0 (= .cse1 29))))) [2019-05-15 10:37:34,927 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:35,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:35,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:35,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:35,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,079 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:35,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:35,080 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:35,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1879]. (let ((.cse1 (select v_main_a_1879 main_x))) (let ((.cse0 (= (store v_main_a_1879 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_1879 main_y) 971) .cse0 (= .cse1 29))))) [2019-05-15 10:37:35,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:37:35,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:35,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:35,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:35,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:35,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,252 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:35,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:35,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:35,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1880]. (let ((.cse2 (select v_main_a_1880 main_y))) (let ((.cse0 (select v_main_a_1880 main_x)) (.cse1 (= (store v_main_a_1880 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 30) .cse1 (= .cse2 971))))) [2019-05-15 10:37:35,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:35,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:35,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:35,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:35,462 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,500 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:35,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:35,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:35,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1881]. (let ((.cse0 (select v_main_a_1881 main_x))) (let ((.cse1 (= (store v_main_a_1881 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 30) .cse1 (= (select v_main_a_1881 main_y) 970)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:37:35,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:37:35,612 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:35,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:35,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:35,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,635 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:35,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,672 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:35,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:35,673 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:35,739 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,740 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1882]. (let ((.cse2 (select v_main_a_1882 main_y))) (let ((.cse0 (= main_a (store v_main_a_1882 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1882 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 31) (= .cse2 970))))) [2019-05-15 10:37:35,740 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:35,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:35,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:35,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:35,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,906 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:35,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:35,906 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:35,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1883]. (let ((.cse0 (select v_main_a_1883 main_x))) (let ((.cse1 (= (store v_main_a_1883 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1883 main_y) 969) .cse1 (= .cse0 31))))) [2019-05-15 10:37:35,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:37:36,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:36,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:36,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:36,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:36,045 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,070 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:36,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:36,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:36,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1884]. (let ((.cse2 (select v_main_a_1884 main_y))) (let ((.cse0 (= (store v_main_a_1884 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1884 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 969 .cse2) (= 32 .cse1))))) [2019-05-15 10:37:36,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:36,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:36,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:36,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,246 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:36,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,286 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:36,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:36,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:36,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1885]. (let ((.cse1 (select v_main_a_1885 main_x))) (let ((.cse0 (= (store v_main_a_1885 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1885 main_y) 968) (= .cse1 32))))) [2019-05-15 10:37:36,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:37:36,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:36,423 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:36,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:36,431 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,456 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:36,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:36,456 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:36,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1886]. (let ((.cse1 (select v_main_a_1886 main_y))) (let ((.cse0 (= (store v_main_a_1886 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1886 main_x))) (or (and .cse0 (= .cse1 968) (= .cse2 33)) (and .cse0 (= main_y main_x) (= .cse2 1001))))) [2019-05-15 10:37:36,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:36,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:36,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:36,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:36,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,701 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:36,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:36,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:36,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1887]. (let ((.cse0 (select v_main_a_1887 main_x))) (let ((.cse1 (= (store v_main_a_1887 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1887 main_y) 967) (= .cse0 33) .cse1)))) [2019-05-15 10:37:36,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:37:36,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:36,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:36,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:36,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,845 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:36,847 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,884 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:36,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:36,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:36,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1888]. (let ((.cse2 (select v_main_a_1888 main_y))) (let ((.cse0 (select v_main_a_1888 main_x)) (.cse1 (= (store v_main_a_1888 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 34) (= .cse2 967) .cse1)))) [2019-05-15 10:37:36,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:37,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:37,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:37,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:37,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,115 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:37,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:37,116 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:37,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1889]. (let ((.cse1 (select v_main_a_1889 main_x))) (let ((.cse0 (= (store v_main_a_1889 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 34) .cse0 (= (select v_main_a_1889 main_y) 966))))) [2019-05-15 10:37:37,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:37:37,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:37,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:37,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:37,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,293 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:37,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:37,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:37,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1890]. (let ((.cse2 (select v_main_a_1890 main_y))) (let ((.cse1 (select v_main_a_1890 main_x)) (.cse0 (= (store v_main_a_1890 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= .cse1 35) (= .cse2 966)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:37:37,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:37:37,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:37,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:37,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:37,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,465 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:37,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:37,466 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:37,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,481 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1891]. (let ((.cse0 (select v_main_a_1891 main_x))) (let ((.cse1 (= (store v_main_a_1891 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 35) .cse1 (= 965 (select v_main_a_1891 main_y)))))) [2019-05-15 10:37:37,481 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:37:37,598 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:37,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:37,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:37,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:37,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,650 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:37,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:37,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:37,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1892]. (let ((.cse2 (select v_main_a_1892 main_y))) (let ((.cse0 (select v_main_a_1892 main_x)) (.cse1 (= (store v_main_a_1892 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 36) .cse1 (= .cse2 965))))) [2019-05-15 10:37:37,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:37:37,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:37,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:37,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,801 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:37,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,829 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:37,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:37,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:37,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1893]. (let ((.cse1 (select v_main_a_1893 main_x))) (let ((.cse0 (= main_a (store v_main_a_1893 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 964 (select v_main_a_1893 main_y)) (= 36 .cse1) .cse0)))) [2019-05-15 10:37:37,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:37:37,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:37,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:37,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:37,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,013 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:38,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:38,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:38,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1894]. (let ((.cse0 (select v_main_a_1894 main_y))) (let ((.cse1 (select v_main_a_1894 main_x)) (.cse2 (= (store v_main_a_1894 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 964) (= .cse1 37) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:37:38,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:38,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:38,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:38,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:38,217 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,255 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:38,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:38,255 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:38,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1895]. (let ((.cse0 (select v_main_a_1895 main_x))) (let ((.cse1 (= (store v_main_a_1895 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 963 (select v_main_a_1895 main_y)) .cse1 (= .cse0 37))))) [2019-05-15 10:37:38,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:37:38,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:38,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:38,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:38,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,437 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:38,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:38,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:38,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1896]. (let ((.cse2 (select v_main_a_1896 main_y))) (let ((.cse0 (= (store v_main_a_1896 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1896 main_x))) (or (and .cse0 (= .cse1 38) (= .cse2 963)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:37:38,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:37:38,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:38,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:38,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:38,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,629 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:38,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:38,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:38,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1897]. (let ((.cse0 (select v_main_a_1897 main_x))) (let ((.cse1 (= main_a (store v_main_a_1897 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1897 main_y) 962) (= .cse0 38) .cse1)))) [2019-05-15 10:37:38,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:37:38,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:38,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:38,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:38,798 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,824 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:38,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:38,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:38,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1898]. (let ((.cse0 (select v_main_a_1898 main_y))) (let ((.cse1 (= (store v_main_a_1898 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_1898 main_x))) (or (and (= .cse0 962) .cse1 (= .cse2 39)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:37:38,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:39,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:39,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:39,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:39,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,066 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:39,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:39,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:39,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1899]. (let ((.cse1 (select v_main_a_1899 main_x))) (let ((.cse0 (= (store v_main_a_1899 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 39) .cse0 (= (select v_main_a_1899 main_y) 961))))) [2019-05-15 10:37:39,080 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 961) (= .cse0 40)))) [2019-05-15 10:37:39,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:39,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:39,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:39,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,286 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:39,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:39,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:39,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1900]. (let ((.cse0 (select v_main_a_1900 main_y))) (let ((.cse1 (select v_main_a_1900 main_x)) (.cse2 (= (store v_main_a_1900 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 961) (= .cse1 40) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:37:39,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:39,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:39,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:39,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:37:39,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,535 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:39,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:39,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:39,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1901]. (let ((.cse1 (select v_main_a_1901 main_x))) (let ((.cse0 (= (store v_main_a_1901 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 40) (= 960 (select v_main_a_1901 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:37:39,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 41) (= (select main_a main_y) 960)))) [2019-05-15 10:37:39,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:39,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:39,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:39,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,722 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:39,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:39,723 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:39,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1902]. (let ((.cse2 (select v_main_a_1902 main_y))) (let ((.cse0 (= (store v_main_a_1902 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1902 main_x))) (or (and .cse0 (= .cse1 41) (= .cse2 960)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:37:39,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 959) (= .cse0 41)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:39,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:39,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:39,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:39,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,965 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:39,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:39,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:39,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1903]. (let ((.cse0 (select v_main_a_1903 main_x))) (let ((.cse1 (= main_a (store v_main_a_1903 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 41) (= (select v_main_a_1903 main_y) 959) .cse1)))) [2019-05-15 10:37:39,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 959) (= .cse0 42)))) [2019-05-15 10:37:40,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:37:40,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:37:40,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:37:40,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:40,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:40,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:37:40,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:40,147 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:37:40,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:37:40,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:37:40,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:40,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1904]. (let ((.cse2 (select v_main_a_1904 main_y))) (let ((.cse0 (= (store v_main_a_1904 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1904 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 959) (= .cse1 42))))) [2019-05-15 10:37:40,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:37:40,362 INFO L273 TraceCheckUtils]: 0: Hoare triple {15597#true} a := a[x := 0]; {15602#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:37:40,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {15602#(= (select main_a main_x) 0)} a := a[y := 1000]; {15606#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:37:40,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {15606#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {15610#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:37:40,365 INFO L273 TraceCheckUtils]: 3: Hoare triple {15610#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {15614#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,366 INFO L273 TraceCheckUtils]: 4: Hoare triple {15614#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15618#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:37:40,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {15618#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {15622#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {15622#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15626#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:37:40,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {15626#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {15630#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {15630#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15634#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:37:40,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {15634#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {15638#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {15638#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15642#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:37:40,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {15642#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {15646#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {15646#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15650#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:37:40,377 INFO L273 TraceCheckUtils]: 13: Hoare triple {15650#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {15654#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:37:40,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {15654#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {15658#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:37:40,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {15658#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {15662#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:37:40,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {15662#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {15666#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:37:40,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {15666#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {15670#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:37:40,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {15670#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {15674#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:37:40,389 INFO L273 TraceCheckUtils]: 19: Hoare triple {15674#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {15678#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {15678#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15682#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:37:40,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {15682#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {15686#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {15686#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15690#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:37:40,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {15690#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {15694#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:37:40,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {15694#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {15698#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:37:40,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {15698#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {15702#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {15702#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15706#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:37:40,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {15706#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {15710#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {15710#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15714#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:37:40,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {15714#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {15718#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:37:40,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {15718#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {15722#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:37:40,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {15722#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {15726#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {15726#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15730#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:37:40,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {15730#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {15734#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {15734#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15738#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:37:40,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {15738#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {15742#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:37:40,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {15742#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {15746#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:37:40,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {15746#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {15750#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {15750#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15754#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:37:40,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {15754#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {15758#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:37:40,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {15758#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {15762#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:37:40,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {15762#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {15766#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {15766#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15770#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:37:40,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {15770#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {15774#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {15774#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15778#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:37:40,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {15778#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {15782#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:37:40,420 INFO L273 TraceCheckUtils]: 46: Hoare triple {15782#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {15786#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:37:40,421 INFO L273 TraceCheckUtils]: 47: Hoare triple {15786#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {15790#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {15790#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15794#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:37:40,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {15794#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {15798#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,424 INFO L273 TraceCheckUtils]: 50: Hoare triple {15798#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15802#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:37:40,425 INFO L273 TraceCheckUtils]: 51: Hoare triple {15802#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {15806#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,426 INFO L273 TraceCheckUtils]: 52: Hoare triple {15806#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15810#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:37:40,428 INFO L273 TraceCheckUtils]: 53: Hoare triple {15810#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {15814#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,429 INFO L273 TraceCheckUtils]: 54: Hoare triple {15814#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15818#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:37:40,430 INFO L273 TraceCheckUtils]: 55: Hoare triple {15818#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {15822#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,431 INFO L273 TraceCheckUtils]: 56: Hoare triple {15822#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15826#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:37:40,432 INFO L273 TraceCheckUtils]: 57: Hoare triple {15826#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {15830#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,433 INFO L273 TraceCheckUtils]: 58: Hoare triple {15830#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15834#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:37:40,434 INFO L273 TraceCheckUtils]: 59: Hoare triple {15834#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {15838#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,436 INFO L273 TraceCheckUtils]: 60: Hoare triple {15838#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15842#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:37:40,437 INFO L273 TraceCheckUtils]: 61: Hoare triple {15842#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {15846#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,438 INFO L273 TraceCheckUtils]: 62: Hoare triple {15846#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15850#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:37:40,439 INFO L273 TraceCheckUtils]: 63: Hoare triple {15850#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {15854#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,440 INFO L273 TraceCheckUtils]: 64: Hoare triple {15854#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15858#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:37:40,441 INFO L273 TraceCheckUtils]: 65: Hoare triple {15858#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {15862#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,442 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15866#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:37:40,444 INFO L273 TraceCheckUtils]: 67: Hoare triple {15866#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {15870#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,445 INFO L273 TraceCheckUtils]: 68: Hoare triple {15870#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15874#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:37:40,446 INFO L273 TraceCheckUtils]: 69: Hoare triple {15874#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {15878#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:37:40,447 INFO L273 TraceCheckUtils]: 70: Hoare triple {15878#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {15882#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:37:40,448 INFO L273 TraceCheckUtils]: 71: Hoare triple {15882#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {15886#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:37:40,449 INFO L273 TraceCheckUtils]: 72: Hoare triple {15886#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {15890#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:37:40,450 INFO L273 TraceCheckUtils]: 73: Hoare triple {15890#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {15894#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:37:40,452 INFO L273 TraceCheckUtils]: 74: Hoare triple {15894#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {15898#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:37:40,453 INFO L273 TraceCheckUtils]: 75: Hoare triple {15898#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {15902#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,454 INFO L273 TraceCheckUtils]: 76: Hoare triple {15902#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15906#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:37:40,455 INFO L273 TraceCheckUtils]: 77: Hoare triple {15906#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {15910#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:37:40,456 INFO L273 TraceCheckUtils]: 78: Hoare triple {15910#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {15914#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:37:40,457 INFO L273 TraceCheckUtils]: 79: Hoare triple {15914#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {15918#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,458 INFO L273 TraceCheckUtils]: 80: Hoare triple {15918#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15922#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} is VALID [2019-05-15 10:37:40,460 INFO L273 TraceCheckUtils]: 81: Hoare triple {15922#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} a := a[y := a[y] - 1]; {15926#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,461 INFO L273 TraceCheckUtils]: 82: Hoare triple {15926#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15930#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} is VALID [2019-05-15 10:37:40,462 INFO L273 TraceCheckUtils]: 83: Hoare triple {15930#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} a := a[y := a[y] - 1]; {15934#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,463 INFO L273 TraceCheckUtils]: 84: Hoare triple {15934#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {15938#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} is VALID [2019-05-15 10:37:40,464 INFO L273 TraceCheckUtils]: 85: Hoare triple {15938#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} a := a[y := a[y] - 1]; {15942#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:37:40,465 INFO L273 TraceCheckUtils]: 86: Hoare triple {15942#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {15598#false} is VALID [2019-05-15 10:37:40,465 INFO L273 TraceCheckUtils]: 87: Hoare triple {15598#false} assume !(a[y] <= 0); {15598#false} is VALID [2019-05-15 10:37:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:40,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:40,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-15 10:37:40,495 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-05-15 10:37:40,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:40,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states. [2019-05-15 10:37:40,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:40,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-05-15 10:37:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-15 10:37:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-05-15 10:37:40,611 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-05-15 10:38:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:00,131 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:38:00,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-15 10:38:00,132 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-05-15 10:38:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:38:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-05-15 10:38:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-05-15 10:38:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-05-15 10:38:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-05-15 10:38:00,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 92 transitions. [2019-05-15 10:38:00,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:00,252 INFO L225 Difference]: With dead ends: 91 [2019-05-15 10:38:00,252 INFO L226 Difference]: Without dead ends: 91 [2019-05-15 10:38:00,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-05-15 10:38:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-05-15 10:38:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-05-15 10:38:00,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:38:00,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2019-05-15 10:38:00,255 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2019-05-15 10:38:00,255 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2019-05-15 10:38:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:00,256 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:38:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:38:00,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:00,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:00,257 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2019-05-15 10:38:00,257 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2019-05-15 10:38:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:00,258 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:38:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:38:00,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:00,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:00,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:38:00,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:38:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-05-15 10:38:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-05-15 10:38:00,259 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-05-15 10:38:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:38:00,259 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-05-15 10:38:00,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-05-15 10:38:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:38:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-05-15 10:38:00,260 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:38:00,260 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-05-15 10:38:00,260 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:38:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:38:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1751725454, now seen corresponding path program 43 times [2019-05-15 10:38:00,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:38:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:00,366 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-15 10:38:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:00,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:38:00,425 INFO L375 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 6 treesize of output 5 [2019-05-15 10:38:00,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:00,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:38:00,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:00,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1905]. (= (store v_main_a_1905 main_x 0) main_a) [2019-05-15 10:38:00,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:38:00,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:00,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:38:00,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,464 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:38:00,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:38:00,467 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:00,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1906]. (and (= (store v_main_a_1906 main_y 1000) main_a) (= (select v_main_a_1906 main_x) 0)) [2019-05-15 10:38:00,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:38:00,490 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:00,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:00,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:00,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:00,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:00,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,537 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:00,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:00,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:00,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:00,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1907]. (let ((.cse2 (select v_main_a_1907 main_x))) (let ((.cse0 (= (store v_main_a_1907 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_1907 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and .cse0 .cse1 (= .cse2 0))))) [2019-05-15 10:38:00,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:38:00,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:00,594 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:00,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:00,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:00,602 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,626 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:00,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:00,626 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:00,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:00,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1908]. (let ((.cse2 (select v_main_a_1908 main_y))) (let ((.cse0 (= (store v_main_a_1908 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1908 main_x))) (or (and .cse0 (= .cse1 1) (= .cse2 1000)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:38:00,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:00,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:00,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:00,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,698 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:00,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:00,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,735 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:00,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:00,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:00,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:00,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1909]. (let ((.cse0 (select v_main_a_1909 main_x))) (let ((.cse1 (= (store v_main_a_1909 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1909 main_y) 999) (= .cse0 1) .cse1)))) [2019-05-15 10:38:00,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:38:00,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:00,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:00,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:00,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,798 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:00,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:00,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,835 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:00,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:00,836 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:00,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:00,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1910]. (let ((.cse2 (select v_main_a_1910 main_y))) (let ((.cse0 (select v_main_a_1910 main_x)) (.cse1 (= (store v_main_a_1910 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 999) (= .cse0 2) .cse1)))) [2019-05-15 10:38:00,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:00,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:00,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:00,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:00,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:00,937 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:00,961 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:00,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:00,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:00,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:00,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1911]. (let ((.cse1 (select v_main_a_1911 main_x))) (let ((.cse0 (= (store v_main_a_1911 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 2) (= (select v_main_a_1911 main_y) 998)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:38:00,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:38:01,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:01,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:01,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,055 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,055 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,088 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1912]. (let ((.cse2 (select v_main_a_1912 main_y))) (let ((.cse1 (select v_main_a_1912 main_x)) (.cse0 (= (store v_main_a_1912 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 3 .cse1) .cse0 (= .cse2 998))))) [2019-05-15 10:38:01,088 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:01,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:01,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,175 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,175 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1913]. (let ((.cse0 (select v_main_a_1913 main_x))) (let ((.cse1 (= main_a (store v_main_a_1913 main_x (+ .cse0 1))))) (or (and (= 3 .cse0) .cse1 (= 997 (select v_main_a_1913 main_y))) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:38:01,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:38:01,225 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:01,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:01,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,273 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1914]. (let ((.cse2 (select v_main_a_1914 main_y))) (let ((.cse1 (select v_main_a_1914 main_x)) (.cse0 (= (store v_main_a_1914 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 997) (= .cse1 4) .cse0)))) [2019-05-15 10:38:01,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:01,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:01,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,386 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,398 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1915]. (let ((.cse0 (select v_main_a_1915 main_x))) (let ((.cse1 (= main_a (store v_main_a_1915 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_1915 main_y) 996) (= .cse0 4) .cse1)))) [2019-05-15 10:38:01,399 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:38:01,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:01,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:01,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,487 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1916]. (let ((.cse2 (select v_main_a_1916 main_y))) (let ((.cse0 (select v_main_a_1916 main_x)) (.cse1 (= main_a (store v_main_a_1916 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 5) .cse1 (= .cse2 996))))) [2019-05-15 10:38:01,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:01,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:01,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,596 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1917]. (let ((.cse0 (select v_main_a_1917 main_x))) (let ((.cse1 (= main_a (store v_main_a_1917 main_x (+ .cse0 1))))) (or (and (= 5 .cse0) (= (select v_main_a_1917 main_y) 995) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:38:01,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:38:01,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:01,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:01,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,712 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1918]. (let ((.cse2 (select v_main_a_1918 main_y))) (let ((.cse0 (select v_main_a_1918 main_x)) (.cse1 (= main_a (store v_main_a_1918 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 6) .cse1 (= .cse2 995))))) [2019-05-15 10:38:01,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:01,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:01,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,859 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1919]. (let ((.cse1 (select v_main_a_1919 main_x))) (let ((.cse0 (= (store v_main_a_1919 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 6) (= 994 (select v_main_a_1919 main_y)) .cse0)))) [2019-05-15 10:38:01,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:38:01,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:01,946 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:01,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:01,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:01,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:01,982 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:01,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:01,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:01,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:01,994 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1920]. (let ((.cse1 (select v_main_a_1920 main_y))) (let ((.cse0 (= (store v_main_a_1920 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1920 main_x))) (or (and .cse0 (= .cse1 994) (= .cse2 7)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:38:01,994 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:38:02,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:02,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:02,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:02,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:02,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,089 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:02,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:02,090 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:02,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:02,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1921]. (let ((.cse0 (select v_main_a_1921 main_x))) (let ((.cse1 (= (store v_main_a_1921 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_1921 main_y) 993) (= .cse0 7) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:38:02,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:38:02,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:02,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:02,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:02,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:02,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:02,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,198 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:02,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:02,199 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:02,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:02,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1922]. (let ((.cse2 (select v_main_a_1922 main_y))) (let ((.cse1 (= main_a (store v_main_a_1922 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1922 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 8) (= .cse2 993))))) [2019-05-15 10:38:02,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:38:02,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:02,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:02,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:02,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:02,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,307 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:02,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:02,308 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:02,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:02,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1923]. (let ((.cse1 (select v_main_a_1923 main_x))) (let ((.cse0 (= main_a (store v_main_a_1923 main_x (+ .cse1 1))))) (or (and .cse0 (= .cse1 8) (= (select v_main_a_1923 main_y) 992)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:38:02,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:38:02,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:02,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:02,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:02,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:02,396 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,421 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:02,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:02,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:02,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:02,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1924]. (let ((.cse1 (select v_main_a_1924 main_y))) (let ((.cse0 (= (store v_main_a_1924 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1924 main_x))) (or (and .cse0 (= .cse1 992) (= 9 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:38:02,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:38:02,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:02,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:02,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:02,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:02,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,545 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:02,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:02,546 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:02,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:02,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1925]. (let ((.cse0 (select v_main_a_1925 main_x))) (let ((.cse1 (= (store v_main_a_1925 main_x (+ .cse0 1)) main_a))) (or (and (= 991 (select v_main_a_1925 main_y)) (= 9 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:38:02,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:38:02,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:02,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:02,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:02,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:02,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,662 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:02,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:02,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:02,705 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:02,705 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1926]. (let ((.cse0 (select v_main_a_1926 main_y))) (let ((.cse2 (= (store v_main_a_1926 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1926 main_x))) (or (and (= .cse0 991) (= 10 .cse1) .cse2) (and (= main_y main_x) .cse2 (= 1001 .cse1))))) [2019-05-15 10:38:02,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:02,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:02,778 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:02,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:02,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:02,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,811 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:02,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:02,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:02,821 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:02,821 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1927]. (let ((.cse1 (select v_main_a_1927 main_x))) (let ((.cse0 (= (store v_main_a_1927 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 990 (select v_main_a_1927 main_y)) (= .cse1 10)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:38:02,821 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:38:02,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:02,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:02,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:02,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:02,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:02,930 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:02,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:02,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:02,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:02,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1928]. (let ((.cse2 (select v_main_a_1928 main_y))) (let ((.cse0 (= (store v_main_a_1928 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1928 main_x))) (or (and .cse0 (= 11 .cse1) (= 990 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:38:02,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:38:03,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:03,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:03,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:03,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:03,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,059 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:03,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:03,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:03,072 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:03,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1929]. (let ((.cse1 (select v_main_a_1929 main_x))) (let ((.cse0 (= main_a (store v_main_a_1929 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_1929 main_y) 989) (= .cse1 11)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:38:03,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:38:03,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:03,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:03,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:03,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:03,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,175 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:03,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:03,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:03,221 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:03,221 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1930]. (let ((.cse1 (select v_main_a_1930 main_y))) (let ((.cse0 (select v_main_a_1930 main_x)) (.cse2 (= (store v_main_a_1930 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 12) (= .cse1 989) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:38:03,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:03,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:03,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:03,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:03,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:03,299 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,335 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:03,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:03,335 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:03,346 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:03,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1931]. (let ((.cse0 (select v_main_a_1931 main_x))) (let ((.cse1 (= (store v_main_a_1931 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_1931 main_y) 988) .cse1 (= 12 .cse0))))) [2019-05-15 10:38:03,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:38:03,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:03,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:03,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:03,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:03,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:03,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,461 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:03,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:03,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:03,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:03,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1932]. (let ((.cse2 (select v_main_a_1932 main_y))) (let ((.cse0 (= (store v_main_a_1932 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1932 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 13 .cse1) (= 988 .cse2))))) [2019-05-15 10:38:03,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:03,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:03,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:03,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:03,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:03,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,601 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:03,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:03,601 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:03,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:03,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1933]. (let ((.cse0 (select v_main_a_1933 main_x))) (let ((.cse1 (= (store v_main_a_1933 main_x (+ .cse0 1)) main_a))) (or (and (= 13 .cse0) .cse1 (= 987 (select v_main_a_1933 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:38:03,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:38:03,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:03,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:03,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:03,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:03,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,733 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:03,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:03,734 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:03,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:03,746 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1934]. (let ((.cse0 (select v_main_a_1934 main_y))) (let ((.cse2 (select v_main_a_1934 main_x)) (.cse1 (= main_a (store v_main_a_1934 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 987) .cse1 (= 14 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:38:03,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:38:03,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:03,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:03,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:03,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:03,828 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,852 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:03,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:03,853 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:03,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:03,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1935]. (let ((.cse0 (select v_main_a_1935 main_x))) (let ((.cse1 (= (store v_main_a_1935 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 14 .cse0) (= 986 (select v_main_a_1935 main_y)) .cse1)))) [2019-05-15 10:38:03,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:38:03,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:03,945 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:03,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:03,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:03,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:03,976 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:03,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:03,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:04,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:04,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1936]. (let ((.cse1 (select v_main_a_1936 main_y))) (let ((.cse0 (select v_main_a_1936 main_x)) (.cse2 (= (store v_main_a_1936 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 15) (= .cse1 986) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:38:04,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:04,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:04,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:04,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:04,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:04,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,149 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:04,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:04,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:04,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:04,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1937]. (let ((.cse0 (select v_main_a_1937 main_x))) (let ((.cse1 (= (store v_main_a_1937 main_x (+ .cse0 1)) main_a))) (or (and (= 15 .cse0) .cse1 (= 985 (select v_main_a_1937 main_y))) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:38:04,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:38:04,232 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:04,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:04,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:04,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:04,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:04,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,290 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:04,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:04,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:04,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:04,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1938]. (let ((.cse2 (select v_main_a_1938 main_y))) (let ((.cse0 (select v_main_a_1938 main_x)) (.cse1 (= main_a (store v_main_a_1938 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 16) (= 985 .cse2) .cse1)))) [2019-05-15 10:38:04,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:04,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:04,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:04,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:04,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:04,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,474 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:04,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:04,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:04,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:04,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1939]. (let ((.cse0 (select v_main_a_1939 main_x))) (let ((.cse1 (= (store v_main_a_1939 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 16) (= (select v_main_a_1939 main_y) 984) .cse1)))) [2019-05-15 10:38:04,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:38:04,556 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:04,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:04,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:04,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:04,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:04,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,605 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:04,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:04,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:04,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:04,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1940]. (let ((.cse2 (select v_main_a_1940 main_y))) (let ((.cse0 (= (store v_main_a_1940 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1940 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 984) (= .cse1 17))))) [2019-05-15 10:38:04,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:38:04,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:04,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:04,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:04,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:04,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,733 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:04,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:04,734 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:04,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:04,746 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1941]. (let ((.cse0 (select v_main_a_1941 main_x))) (let ((.cse1 (= (store v_main_a_1941 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 17) (= (select v_main_a_1941 main_y) 983) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:38:04,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:38:04,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:04,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:04,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:04,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:04,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:04,876 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:04,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:04,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:04,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:04,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1942]. (let ((.cse0 (select v_main_a_1942 main_y))) (let ((.cse2 (= (store v_main_a_1942 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_1942 main_x))) (or (and (= 983 .cse0) (= .cse1 18) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:38:04,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:05,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:05,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:05,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:05,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:05,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,057 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:05,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:05,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:05,070 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:05,070 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1943]. (let ((.cse1 (select v_main_a_1943 main_x))) (let ((.cse0 (= (store v_main_a_1943 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 18 .cse1) (= 982 (select v_main_a_1943 main_y)))))) [2019-05-15 10:38:05,070 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:38:05,140 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:05,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:05,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:05,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:05,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:05,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,189 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:05,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:05,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:05,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:05,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1944]. (let ((.cse2 (select v_main_a_1944 main_y))) (let ((.cse1 (= main_a (store v_main_a_1944 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_1944 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 982) (= .cse0 19))))) [2019-05-15 10:38:05,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:38:05,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:05,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:05,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:05,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:05,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,330 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:05,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:05,331 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:05,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:05,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1945]. (let ((.cse0 (select v_main_a_1945 main_x))) (let ((.cse1 (= (store v_main_a_1945 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 19) .cse1 (= (select v_main_a_1945 main_y) 981))))) [2019-05-15 10:38:05,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:38:05,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:05,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:05,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:05,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:05,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,478 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:05,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:05,479 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:05,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:05,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1946]. (let ((.cse2 (select v_main_a_1946 main_y))) (let ((.cse0 (= (store v_main_a_1946 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1946 main_x))) (or (and .cse0 (= 20 .cse1) (= 981 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:38:05,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:05,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:05,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:05,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:05,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:05,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,629 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:05,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:05,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:05,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:05,640 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1947]. (let ((.cse0 (select v_main_a_1947 main_x))) (let ((.cse1 (= main_a (store v_main_a_1947 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 20) .cse1 (= (select v_main_a_1947 main_y) 980))))) [2019-05-15 10:38:05,640 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:38:05,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:05,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:05,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:05,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,741 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:05,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:05,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,768 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:05,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:05,769 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:05,863 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:05,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1948]. (let ((.cse2 (select v_main_a_1948 main_y))) (let ((.cse0 (select v_main_a_1948 main_x)) (.cse1 (= (store v_main_a_1948 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 21) .cse1 (= 980 .cse2))))) [2019-05-15 10:38:05,864 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:05,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:05,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:05,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:05,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:05,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:05,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,002 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:06,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:06,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:06,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:06,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1949]. (let ((.cse0 (select v_main_a_1949 main_x))) (let ((.cse1 (= (store v_main_a_1949 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 21 .cse0) .cse1 (= (select v_main_a_1949 main_y) 979))))) [2019-05-15 10:38:06,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:38:06,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:06,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:06,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:06,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:06,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,149 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:06,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:06,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:06,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:06,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1950]. (let ((.cse1 (select v_main_a_1950 main_y))) (let ((.cse2 (= (store v_main_a_1950 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_1950 main_x))) (or (and (= .cse0 22) (= .cse1 979) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:38:06,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:38:06,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:06,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:06,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:06,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:06,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,293 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:06,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:06,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:06,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:06,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1951]. (let ((.cse0 (select v_main_a_1951 main_x))) (let ((.cse1 (= (store v_main_a_1951 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 22) (= (select v_main_a_1951 main_y) 978) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:38:06,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:38:06,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:06,406 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:06,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:06,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:06,414 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,448 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:06,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:06,448 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:06,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:06,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1952]. (let ((.cse2 (select v_main_a_1952 main_y))) (let ((.cse1 (select v_main_a_1952 main_x)) (.cse0 (= (store v_main_a_1952 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= .cse1 23) (= .cse2 978)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:38:06,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:06,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:06,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:06,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:06,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:06,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,635 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:06,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:06,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:06,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:06,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1953]. (let ((.cse0 (select v_main_a_1953 main_x))) (let ((.cse1 (= (store v_main_a_1953 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= (select v_main_a_1953 main_y) 977) (= 23 .cse0))))) [2019-05-15 10:38:06,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:38:06,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:06,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:06,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:06,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:06,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,785 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:06,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:06,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:06,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:06,835 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1954]. (let ((.cse2 (select v_main_a_1954 main_y))) (let ((.cse1 (select v_main_a_1954 main_x)) (.cse0 (= (store v_main_a_1954 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= 24 .cse1) (= 977 .cse2)) (and (= main_y main_x) (= 1001 .cse1) .cse0)))) [2019-05-15 10:38:06,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:06,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:06,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:06,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:06,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:06,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:06,986 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:06,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:06,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:06,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:06,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1955]. (let ((.cse0 (select v_main_a_1955 main_x))) (let ((.cse1 (= (store v_main_a_1955 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 24) .cse1 (= (select v_main_a_1955 main_y) 976)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:38:06,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:38:07,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:07,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:07,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:07,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:07,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,138 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:07,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:07,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:07,214 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:07,214 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1956]. (let ((.cse1 (select v_main_a_1956 main_y))) (let ((.cse0 (= (store v_main_a_1956 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1956 main_x))) (or (and .cse0 (= 976 .cse1) (= 25 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:38:07,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:07,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:07,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:07,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:07,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:07,328 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,353 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:07,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:07,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:07,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:07,367 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1957]. (let ((.cse0 (select v_main_a_1957 main_x))) (let ((.cse1 (= (store v_main_a_1957 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 25) (= (select v_main_a_1957 main_y) 975) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:38:07,367 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:38:07,454 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:07,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:07,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:07,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:07,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:07,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,514 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:07,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:07,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:07,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:07,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1958]. (let ((.cse2 (select v_main_a_1958 main_y))) (let ((.cse0 (select v_main_a_1958 main_x)) (.cse1 (= (store v_main_a_1958 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 26) .cse1 (= .cse2 975))))) [2019-05-15 10:38:07,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:07,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:07,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:07,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:07,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:07,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,695 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:07,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:07,695 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:07,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:07,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1959]. (let ((.cse1 (select v_main_a_1959 main_x))) (let ((.cse0 (= main_a (store v_main_a_1959 main_x (+ .cse1 1))))) (or (and (= 974 (select v_main_a_1959 main_y)) .cse0 (= 26 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:38:07,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:38:07,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:07,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:07,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:07,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:07,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:07,858 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:07,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:07,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:07,917 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:07,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1960]. (let ((.cse1 (select v_main_a_1960 main_y))) (let ((.cse0 (= (store v_main_a_1960 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_1960 main_x))) (or (and .cse0 (= .cse1 974) (= .cse2 27)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:38:07,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:08,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:08,027 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:08,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:08,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,060 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:08,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:08,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:08,072 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1961]. (let ((.cse0 (select v_main_a_1961 main_x))) (let ((.cse1 (= (store v_main_a_1961 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 27) .cse1 (= (select v_main_a_1961 main_y) 973)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:38:08,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:38:08,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:08,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:08,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:08,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:08,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,219 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:08,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:08,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:08,280 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1962]. (let ((.cse2 (select v_main_a_1962 main_y))) (let ((.cse1 (select v_main_a_1962 main_x)) (.cse0 (= (store v_main_a_1962 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 28 .cse1) (= 973 .cse2) .cse0)))) [2019-05-15 10:38:08,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:08,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:08,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:08,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,396 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:08,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,424 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:08,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:08,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:08,437 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1963]. (let ((.cse1 (select v_main_a_1963 main_x))) (let ((.cse0 (= (store v_main_a_1963 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 28 .cse1) (= (select v_main_a_1963 main_y) 972))))) [2019-05-15 10:38:08,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:38:08,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:08,557 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:08,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:08,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,591 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:08,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:08,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:08,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1964]. (let ((.cse1 (select v_main_a_1964 main_y))) (let ((.cse2 (= main_a (store v_main_a_1964 main_y (+ .cse1 (- 1))))) (.cse0 (select v_main_a_1964 main_x))) (or (and (= .cse0 29) (= .cse1 972) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:38:08,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:08,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:08,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:08,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:08,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,844 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:08,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:08,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:08,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1965]. (let ((.cse0 (select v_main_a_1965 main_x))) (let ((.cse1 (= (store v_main_a_1965 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 971 (select v_main_a_1965 main_y)) (= .cse0 29) .cse1)))) [2019-05-15 10:38:08,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:38:08,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:08,978 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:08,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:08,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,022 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:09,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:09,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:09,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1966]. (let ((.cse2 (select v_main_a_1966 main_y))) (let ((.cse0 (= main_a (store v_main_a_1966 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1966 main_x))) (or (and .cse0 (= .cse1 30) (= .cse2 971)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:38:09,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:09,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:09,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:09,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,246 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:09,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,282 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:09,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:09,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:09,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1967]. (let ((.cse0 (select v_main_a_1967 main_x))) (let ((.cse1 (= (store v_main_a_1967 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 30) .cse1 (= 970 (select v_main_a_1967 main_y)))))) [2019-05-15 10:38:09,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:38:09,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:09,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:09,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:09,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:09,415 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,450 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:09,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:09,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:09,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1968]. (let ((.cse2 (select v_main_a_1968 main_y))) (let ((.cse0 (= (store v_main_a_1968 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1968 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 970) (= .cse1 31))))) [2019-05-15 10:38:09,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:09,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:09,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:09,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:09,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,634 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:09,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:09,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:09,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1969]. (let ((.cse0 (select v_main_a_1969 main_x))) (let ((.cse1 (= (store v_main_a_1969 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= .cse0 31) (= (select v_main_a_1969 main_y) 969))))) [2019-05-15 10:38:09,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:38:09,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:09,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:09,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:09,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,795 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:09,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:09,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:09,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,835 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1970]. (let ((.cse1 (select v_main_a_1970 main_y))) (let ((.cse0 (select v_main_a_1970 main_x)) (.cse2 (= (store v_main_a_1970 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 32) (= .cse1 969) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:38:09,835 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:09,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:09,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:09,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:09,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,996 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:09,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:09,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:10,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1971]. (let ((.cse1 (select v_main_a_1971 main_x))) (let ((.cse0 (= (store v_main_a_1971 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1971 main_y) 968) (= .cse1 32)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:38:10,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:38:10,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:10,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:10,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:10,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,160 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:10,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:10,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:10,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1972]. (let ((.cse0 (select v_main_a_1972 main_y))) (let ((.cse1 (select v_main_a_1972 main_x)) (.cse2 (= (store v_main_a_1972 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 968 .cse0) (= 33 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:38:10,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:10,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:10,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:10,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:10,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,395 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:10,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:10,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:10,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1973]. (let ((.cse0 (select v_main_a_1973 main_x))) (let ((.cse1 (= (store v_main_a_1973 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 33 .cse0) (= 967 (select v_main_a_1973 main_y)) .cse1)))) [2019-05-15 10:38:10,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:38:10,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:10,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:10,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:10,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,575 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:10,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:10,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:10,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1974]. (let ((.cse2 (select v_main_a_1974 main_y))) (let ((.cse0 (= (store v_main_a_1974 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1974 main_x))) (or (and .cse0 (= .cse1 34) (= 967 .cse2)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:38:10,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:10,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:10,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:10,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:10,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,814 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:10,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:10,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:10,823 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1975]. (let ((.cse1 (select v_main_a_1975 main_x))) (let ((.cse0 (= (store v_main_a_1975 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 34) (= (select v_main_a_1975 main_y) 966)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:38:10,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:38:10,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:10,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:10,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:10,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:10,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,978 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:10,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:10,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:10,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1976]. (let ((.cse2 (select v_main_a_1976 main_y))) (let ((.cse1 (select v_main_a_1976 main_x)) (.cse0 (= (store v_main_a_1976 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 966) (= .cse1 35) .cse0)))) [2019-05-15 10:38:10,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:38:11,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:11,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:11,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:11,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,149 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:11,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:11,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:11,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1977]. (let ((.cse0 (select v_main_a_1977 main_x))) (let ((.cse1 (= (store v_main_a_1977 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 35) .cse1 (= (select v_main_a_1977 main_y) 965))))) [2019-05-15 10:38:11,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:38:11,272 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:11,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:11,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:11,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:11,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,320 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:11,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:11,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:11,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1978]. (let ((.cse2 (select v_main_a_1978 main_y))) (let ((.cse0 (select v_main_a_1978 main_x)) (.cse1 (= (store v_main_a_1978 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 965) (= .cse0 36) .cse1)))) [2019-05-15 10:38:11,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:38:11,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:11,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:11,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:11,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,482 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:11,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:11,482 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:11,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1979]. (let ((.cse1 (select v_main_a_1979 main_x))) (let ((.cse0 (= (store v_main_a_1979 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 36) (= (select v_main_a_1979 main_y) 964))))) [2019-05-15 10:38:11,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:38:11,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:11,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:11,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:11,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:11,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,653 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:11,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:11,653 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:11,712 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1980]. (let ((.cse2 (select v_main_a_1980 main_y))) (let ((.cse1 (= (store v_main_a_1980 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1980 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 964) .cse1 (= .cse0 37))))) [2019-05-15 10:38:11,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:11,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:11,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:11,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:11,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,889 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:11,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:11,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:11,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1981]. (let ((.cse1 (select v_main_a_1981 main_x))) (let ((.cse0 (= (store v_main_a_1981 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_1981 main_y) 963) .cse0 (= 37 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:38:11,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:38:12,019 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:12,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:12,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:12,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:12,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,067 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:12,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:12,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:12,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1982]. (let ((.cse2 (select v_main_a_1982 main_y))) (let ((.cse1 (select v_main_a_1982 main_x)) (.cse0 (= (store v_main_a_1982 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 38) .cse0 (= .cse2 963))))) [2019-05-15 10:38:12,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:38:12,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:12,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:12,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:12,344 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,380 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:12,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:12,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:12,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1983]. (let ((.cse0 (select v_main_a_1983 main_x))) (let ((.cse1 (= (store v_main_a_1983 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 38) (= (select v_main_a_1983 main_y) 962) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:38:12,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:38:12,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:12,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:12,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:12,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,539 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:12,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,567 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:12,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:12,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:12,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1984]. (let ((.cse2 (select v_main_a_1984 main_y))) (let ((.cse0 (select v_main_a_1984 main_x)) (.cse1 (= (store v_main_a_1984 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 962) (= .cse0 39) .cse1)))) [2019-05-15 10:38:12,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:12,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:12,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:12,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:12,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,803 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:12,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:12,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:12,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1985]. (let ((.cse1 (select v_main_a_1985 main_x))) (let ((.cse0 (= (store v_main_a_1985 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_1985 main_y) 961) (= .cse1 39)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:38:12,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 961) (= .cse0 40)))) [2019-05-15 10:38:12,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:12,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:12,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:12,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,989 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:12,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:12,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:13,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,071 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1986]. (let ((.cse1 (select v_main_a_1986 main_y))) (let ((.cse0 (select v_main_a_1986 main_x)) (.cse2 (= (store v_main_a_1986 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 40 .cse0) (= 961 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:38:13,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:13,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:13,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:13,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:13,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,251 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:13,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:13,252 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:13,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1987]. (let ((.cse0 (select v_main_a_1987 main_x))) (let ((.cse1 (= (store v_main_a_1987 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_1987 main_y) 960) .cse1 (= 40 .cse0))))) [2019-05-15 10:38:13,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 41) (= (select main_a main_y) 960)))) [2019-05-15 10:38:13,389 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:13,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:13,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:13,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:13,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,450 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:13,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:13,450 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:13,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1988]. (let ((.cse2 (select v_main_a_1988 main_y))) (let ((.cse0 (= main_a (store v_main_a_1988 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_1988 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 41) (= .cse2 960))))) [2019-05-15 10:38:13,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 959) (= .cse0 41)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:13,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:13,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:13,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:13,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,704 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:13,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:13,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:13,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1989]. (let ((.cse0 (select v_main_a_1989 main_x))) (let ((.cse1 (= (store v_main_a_1989 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 41) .cse1 (= (select v_main_a_1989 main_y) 959)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:38:13,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 959) (= .cse0 42)))) [2019-05-15 10:38:13,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:13,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:13,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:13,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,901 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:13,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:13,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:13,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1990]. (let ((.cse0 (select v_main_a_1990 main_y))) (let ((.cse1 (= main_a (store v_main_a_1990 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_1990 main_x))) (or (and (= .cse0 959) .cse1 (= .cse2 42)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:38:13,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:14,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:14,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:14,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:14,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,160 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:14,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:14,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:14,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1991]. (let ((.cse1 (select v_main_a_1991 main_x))) (let ((.cse0 (= (store v_main_a_1991 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= (select v_main_a_1991 main_y) 958) (= .cse1 42))))) [2019-05-15 10:38:14,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 43) (= (select main_a main_y) 958)))) [2019-05-15 10:38:14,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:14,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:14,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:14,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,358 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:14,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:14,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:14,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1992]. (let ((.cse2 (select v_main_a_1992 main_y))) (let ((.cse1 (= (store v_main_a_1992 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_1992 main_x))) (or (and (= .cse0 43) .cse1 (= .cse2 958)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:38:14,412 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:14,530 INFO L273 TraceCheckUtils]: 0: Hoare triple {16312#true} a := a[x := 0]; {16317#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:38:14,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {16317#(= (select main_a main_x) 0)} a := a[y := 1000]; {16321#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:38:14,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {16321#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {16325#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:38:14,533 INFO L273 TraceCheckUtils]: 3: Hoare triple {16325#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {16329#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,534 INFO L273 TraceCheckUtils]: 4: Hoare triple {16329#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16333#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:38:14,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {16333#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {16337#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {16337#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16341#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:38:14,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {16341#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {16345#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {16345#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16349#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:38:14,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {16349#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {16353#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {16353#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16357#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:38:14,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {16357#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {16361#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {16361#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16365#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:38:14,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {16365#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {16369#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:38:14,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {16369#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {16373#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:38:14,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {16373#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {16377#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:38:14,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {16377#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {16381#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:38:14,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {16381#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {16385#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:38:14,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {16385#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {16389#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:38:14,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {16389#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {16393#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {16393#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16397#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:38:14,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {16397#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {16401#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {16401#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16405#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:38:14,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {16405#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {16409#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:38:14,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {16409#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {16413#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:38:14,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {16413#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {16417#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {16417#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16421#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:38:14,562 INFO L273 TraceCheckUtils]: 27: Hoare triple {16421#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {16425#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {16425#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16429#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:38:14,564 INFO L273 TraceCheckUtils]: 29: Hoare triple {16429#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {16433#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:38:14,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {16433#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {16437#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:38:14,566 INFO L273 TraceCheckUtils]: 31: Hoare triple {16437#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {16441#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {16441#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16445#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:38:14,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {16445#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {16449#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {16449#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16453#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:38:14,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {16453#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {16457#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:38:14,573 INFO L273 TraceCheckUtils]: 36: Hoare triple {16457#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {16461#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:38:14,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {16461#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {16465#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,575 INFO L273 TraceCheckUtils]: 38: Hoare triple {16465#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16469#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:38:14,576 INFO L273 TraceCheckUtils]: 39: Hoare triple {16469#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {16473#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:38:14,577 INFO L273 TraceCheckUtils]: 40: Hoare triple {16473#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {16477#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:38:14,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {16477#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {16481#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {16481#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16485#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:38:14,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {16485#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {16489#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,582 INFO L273 TraceCheckUtils]: 44: Hoare triple {16489#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16493#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:38:14,584 INFO L273 TraceCheckUtils]: 45: Hoare triple {16493#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {16497#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:38:14,585 INFO L273 TraceCheckUtils]: 46: Hoare triple {16497#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {16501#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:38:14,586 INFO L273 TraceCheckUtils]: 47: Hoare triple {16501#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {16505#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,587 INFO L273 TraceCheckUtils]: 48: Hoare triple {16505#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16509#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:38:14,588 INFO L273 TraceCheckUtils]: 49: Hoare triple {16509#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {16513#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {16513#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16517#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:38:14,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {16517#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {16521#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {16521#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16525#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:38:14,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {16525#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {16529#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,594 INFO L273 TraceCheckUtils]: 54: Hoare triple {16529#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16533#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:38:14,596 INFO L273 TraceCheckUtils]: 55: Hoare triple {16533#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {16537#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,597 INFO L273 TraceCheckUtils]: 56: Hoare triple {16537#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16541#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:38:14,598 INFO L273 TraceCheckUtils]: 57: Hoare triple {16541#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {16545#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,599 INFO L273 TraceCheckUtils]: 58: Hoare triple {16545#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16549#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:38:14,600 INFO L273 TraceCheckUtils]: 59: Hoare triple {16549#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {16553#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,602 INFO L273 TraceCheckUtils]: 60: Hoare triple {16553#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16557#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:38:14,603 INFO L273 TraceCheckUtils]: 61: Hoare triple {16557#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {16561#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,604 INFO L273 TraceCheckUtils]: 62: Hoare triple {16561#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16565#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:38:14,605 INFO L273 TraceCheckUtils]: 63: Hoare triple {16565#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {16569#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,607 INFO L273 TraceCheckUtils]: 64: Hoare triple {16569#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16573#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:38:14,608 INFO L273 TraceCheckUtils]: 65: Hoare triple {16573#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {16577#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,609 INFO L273 TraceCheckUtils]: 66: Hoare triple {16577#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16581#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:38:14,610 INFO L273 TraceCheckUtils]: 67: Hoare triple {16581#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {16585#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,612 INFO L273 TraceCheckUtils]: 68: Hoare triple {16585#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16589#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:38:14,613 INFO L273 TraceCheckUtils]: 69: Hoare triple {16589#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {16593#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:38:14,614 INFO L273 TraceCheckUtils]: 70: Hoare triple {16593#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {16597#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:38:14,615 INFO L273 TraceCheckUtils]: 71: Hoare triple {16597#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {16601#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:38:14,616 INFO L273 TraceCheckUtils]: 72: Hoare triple {16601#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {16605#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:38:14,617 INFO L273 TraceCheckUtils]: 73: Hoare triple {16605#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {16609#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:38:14,619 INFO L273 TraceCheckUtils]: 74: Hoare triple {16609#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {16613#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:38:14,620 INFO L273 TraceCheckUtils]: 75: Hoare triple {16613#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {16617#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,621 INFO L273 TraceCheckUtils]: 76: Hoare triple {16617#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16621#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:38:14,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {16621#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {16625#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:38:14,623 INFO L273 TraceCheckUtils]: 78: Hoare triple {16625#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {16629#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:38:14,624 INFO L273 TraceCheckUtils]: 79: Hoare triple {16629#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {16633#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,626 INFO L273 TraceCheckUtils]: 80: Hoare triple {16633#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16637#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} is VALID [2019-05-15 10:38:14,627 INFO L273 TraceCheckUtils]: 81: Hoare triple {16637#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} a := a[y := a[y] - 1]; {16641#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,628 INFO L273 TraceCheckUtils]: 82: Hoare triple {16641#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16645#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} is VALID [2019-05-15 10:38:14,629 INFO L273 TraceCheckUtils]: 83: Hoare triple {16645#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} a := a[y := a[y] - 1]; {16649#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,630 INFO L273 TraceCheckUtils]: 84: Hoare triple {16649#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16653#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} is VALID [2019-05-15 10:38:14,632 INFO L273 TraceCheckUtils]: 85: Hoare triple {16653#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} a := a[y := a[y] - 1]; {16657#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,633 INFO L273 TraceCheckUtils]: 86: Hoare triple {16657#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {16661#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} is VALID [2019-05-15 10:38:14,634 INFO L273 TraceCheckUtils]: 87: Hoare triple {16661#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} a := a[y := a[y] - 1]; {16665#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:14,635 INFO L273 TraceCheckUtils]: 88: Hoare triple {16665#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {16313#false} is VALID [2019-05-15 10:38:14,635 INFO L273 TraceCheckUtils]: 89: Hoare triple {16313#false} assume !(a[y] <= 0); {16313#false} is VALID [2019-05-15 10:38:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:38:14,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:38:14,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-15 10:38:14,666 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-05-15 10:38:14,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:38:14,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states. [2019-05-15 10:38:14,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:14,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-05-15 10:38:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-15 10:38:14,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2019-05-15 10:38:14,783 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-05-15 10:38:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:35,322 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:38:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-15 10:38:35,323 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-05-15 10:38:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:38:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-05-15 10:38:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-05-15 10:38:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-05-15 10:38:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-05-15 10:38:35,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states and 94 transitions. [2019-05-15 10:38:35,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:35,444 INFO L225 Difference]: With dead ends: 93 [2019-05-15 10:38:35,445 INFO L226 Difference]: Without dead ends: 93 [2019-05-15 10:38:35,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2019-05-15 10:38:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-05-15 10:38:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-05-15 10:38:35,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:38:35,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2019-05-15 10:38:35,447 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2019-05-15 10:38:35,447 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2019-05-15 10:38:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:35,448 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:38:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:38:35,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:35,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:35,449 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2019-05-15 10:38:35,449 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2019-05-15 10:38:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:35,450 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:38:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:38:35,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:35,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:35,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:38:35,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:38:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-05-15 10:38:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-05-15 10:38:35,452 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-05-15 10:38:35,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:38:35,452 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-05-15 10:38:35,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-05-15 10:38:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:38:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-05-15 10:38:35,453 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:38:35,453 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-05-15 10:38:35,453 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:38:35,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:38:35,454 INFO L82 PathProgramCache]: Analyzing trace with hash -219172177, now seen corresponding path program 44 times [2019-05-15 10:38:35,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:38:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:35,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-15 10:38:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:35,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:38:35,610 INFO L375 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 6 treesize of output 5 [2019-05-15 10:38:35,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:38:35,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1993]. (= (store v_main_a_1993 main_x 0) main_a) [2019-05-15 10:38:35,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:38:35,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:38:35,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,653 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:38:35,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:38:35,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1994]. (and (= (store v_main_a_1994 main_y 1000) main_a) (= (select v_main_a_1994 main_x) 0)) [2019-05-15 10:38:35,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:38:35,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:35,699 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:35,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:35,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,729 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:35,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:35,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:35,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,738 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1995]. (let ((.cse2 (select v_main_a_1995 main_x))) (let ((.cse0 (= (store v_main_a_1995 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_1995 main_y) 1000))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= main_y main_x) .cse0 .cse1)))) [2019-05-15 10:38:35,738 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:38:35,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:35,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:35,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:35,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:35,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,817 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:35,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:35,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:35,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1996]. (let ((.cse2 (select v_main_a_1996 main_y))) (let ((.cse0 (= (store v_main_a_1996 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_1996 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 1000) .cse0 (= .cse1 1))))) [2019-05-15 10:38:35,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:35,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:35,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:35,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:35,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,945 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:35,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:35,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:35,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1997]. (let ((.cse1 (select v_main_a_1997 main_x))) (let ((.cse0 (= (store v_main_a_1997 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_1997 main_y) 999) (= .cse1 1))))) [2019-05-15 10:38:35,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:38:35,991 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:35,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:35,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:35,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,052 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:36,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:36,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:36,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1998]. (let ((.cse2 (select v_main_a_1998 main_y))) (let ((.cse1 (select v_main_a_1998 main_x)) (.cse0 (= main_a (store v_main_a_1998 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 2) (= 999 .cse2) .cse0)))) [2019-05-15 10:38:36,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:36,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:36,148 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:36,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,179 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:36,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:36,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:36,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_1999]. (let ((.cse0 (select v_main_a_1999 main_x))) (let ((.cse1 (= (store v_main_a_1999 main_x (+ .cse0 1)) main_a))) (or (and (= 998 (select v_main_a_1999 main_y)) (= 2 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:38:36,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:38:36,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:36,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:36,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,278 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:36,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:36,278 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:36,327 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2000]. (let ((.cse1 (select v_main_a_2000 main_y))) (let ((.cse0 (select v_main_a_2000 main_x)) (.cse2 (= (store v_main_a_2000 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 3) (= 998 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:38:36,327 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:36,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:36,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:36,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,408 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:36,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:36,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:36,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2001]. (let ((.cse1 (select v_main_a_2001 main_x))) (let ((.cse0 (= (store v_main_a_2001 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 997 (select v_main_a_2001 main_y)) (= 3 .cse1))))) [2019-05-15 10:38:36,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:38:36,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:36,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:36,482 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,506 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:36,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:36,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:36,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2002]. (let ((.cse2 (select v_main_a_2002 main_y))) (let ((.cse0 (select v_main_a_2002 main_x)) (.cse1 (= main_a (store v_main_a_2002 main_y (+ .cse2 (- 1)))))) (or (and (= 4 .cse0) .cse1 (= 997 .cse2)) (and (= main_y main_x) (= 1001 .cse0) .cse1)))) [2019-05-15 10:38:36,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:36,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:36,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:36,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,663 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:36,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:36,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:36,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2003]. (let ((.cse1 (select v_main_a_2003 main_x))) (let ((.cse0 (= (store v_main_a_2003 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_2003 main_y) 996) (= .cse1 4) .cse0)))) [2019-05-15 10:38:36,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:38:36,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:36,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:36,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:36,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,765 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:36,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:36,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:36,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2004]. (let ((.cse2 (select v_main_a_2004 main_y))) (let ((.cse0 (select v_main_a_2004 main_x)) (.cse1 (= (store v_main_a_2004 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 996) (= .cse0 5) .cse1)))) [2019-05-15 10:38:36,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:36,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:36,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:36,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,892 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:36,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:36,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:36,907 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2005]. (let ((.cse1 (select v_main_a_2005 main_x))) (let ((.cse0 (= (store v_main_a_2005 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 995 (select v_main_a_2005 main_y)) (= .cse1 5)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:38:36,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:38:36,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:36,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:36,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:36,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:36,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,007 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2006]. (let ((.cse2 (select v_main_a_2006 main_y))) (let ((.cse0 (select v_main_a_2006 main_x)) (.cse1 (= (store v_main_a_2006 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 6) (= 995 .cse2) .cse1)))) [2019-05-15 10:38:37,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:37,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:37,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:37,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:37,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:37,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,136 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,148 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2007]. (let ((.cse1 (select v_main_a_2007 main_x))) (let ((.cse0 (= (store v_main_a_2007 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 6) .cse0 (= (select v_main_a_2007 main_y) 994))))) [2019-05-15 10:38:37,148 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:38:37,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:37,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:37,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:37,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:37,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,242 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2008]. (let ((.cse0 (select v_main_a_2008 main_y))) (let ((.cse1 (= (store v_main_a_2008 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_2008 main_x))) (or (and (= .cse0 994) .cse1 (= .cse2 7)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:38:37,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:38:37,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:37,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:37,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:37,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:37,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,349 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,349 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2009]. (let ((.cse1 (select v_main_a_2009 main_x))) (let ((.cse0 (= (store v_main_a_2009 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 7 .cse1) (= 993 (select v_main_a_2009 main_y))) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:38:37,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:38:37,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:37,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:37,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:37,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:37,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,460 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2010]. (let ((.cse1 (select v_main_a_2010 main_y))) (let ((.cse0 (select v_main_a_2010 main_x)) (.cse2 (= (store v_main_a_2010 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 8) (= .cse1 993) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:38:37,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:37,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:37,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:37,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:37,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:37,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,587 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,588 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2011]. (let ((.cse0 (select v_main_a_2011 main_x))) (let ((.cse1 (= (store v_main_a_2011 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 8 .cse0) (= (select v_main_a_2011 main_y) 992) .cse1)))) [2019-05-15 10:38:37,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:38:37,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:37,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:37,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:37,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:37,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:37,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,698 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2012]. (let ((.cse2 (select v_main_a_2012 main_y))) (let ((.cse1 (select v_main_a_2012 main_x)) (.cse0 (= (store v_main_a_2012 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 9) .cse0 (= .cse2 992))))) [2019-05-15 10:38:37,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:38:37,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:37,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:37,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:37,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:37,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,832 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2013]. (let ((.cse0 (select v_main_a_2013 main_x))) (let ((.cse1 (= (store v_main_a_2013 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 9) (= (select v_main_a_2013 main_y) 991) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:38:37,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:38:37,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:37,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:37,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:37,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:37,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:37,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:37,943 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:37,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:37,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:37,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:37,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2014]. (let ((.cse2 (select v_main_a_2014 main_y))) (let ((.cse0 (select v_main_a_2014 main_x)) (.cse1 (= (store v_main_a_2014 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 991 .cse2) (= 10 .cse0) .cse1)))) [2019-05-15 10:38:37,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:38,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:38,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:38,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,064 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:38,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:38,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,091 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:38,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:38,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:38,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:38,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2015]. (let ((.cse0 (select v_main_a_2015 main_x))) (let ((.cse1 (= (store v_main_a_2015 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 990 (select v_main_a_2015 main_y)) .cse1 (= 10 .cse0))))) [2019-05-15 10:38:38,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:38:38,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:38,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:38,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:38,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:38,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,208 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:38,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:38,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:38,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:38,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2016]. (let ((.cse2 (select v_main_a_2016 main_y))) (let ((.cse0 (= (store v_main_a_2016 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2016 main_x))) (or (and .cse0 (= 11 .cse1) (= 990 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse1))))) [2019-05-15 10:38:38,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:38:38,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:38,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:38,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:38,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:38,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,328 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:38,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:38,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:38,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:38,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2017]. (let ((.cse1 (select v_main_a_2017 main_x))) (let ((.cse0 (= main_a (store v_main_a_2017 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_2017 main_y) 989) .cse0 (= .cse1 11)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:38:38,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:38:38,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:38,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:38,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:38,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:38,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,452 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:38,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:38,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:38,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:38,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2018]. (let ((.cse2 (select v_main_a_2018 main_y))) (let ((.cse1 (= (store v_main_a_2018 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2018 main_x))) (or (and (= .cse0 12) .cse1 (= .cse2 989)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:38:38,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:38,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:38,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:38,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:38,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:38,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,613 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:38,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:38,614 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:38,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:38,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2019]. (let ((.cse0 (select v_main_a_2019 main_x))) (let ((.cse1 (= (store v_main_a_2019 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_2019 main_y) 988) (= .cse0 12) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:38:38,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:38:38,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:38,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:38,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:38,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:38,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:38,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,745 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:38,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:38,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:38,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:38,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2020]. (let ((.cse2 (select v_main_a_2020 main_y))) (let ((.cse0 (select v_main_a_2020 main_x)) (.cse1 (= (store v_main_a_2020 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 13 .cse0) .cse1 (= .cse2 988))))) [2019-05-15 10:38:38,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:38,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:38,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:38,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:38,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:38,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:38,993 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:38,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:38,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:39,006 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:39,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2021]. (let ((.cse1 (select v_main_a_2021 main_x))) (let ((.cse0 (= (store v_main_a_2021 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_2021 main_y) 987) (= .cse1 13) .cse0)))) [2019-05-15 10:38:39,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:38:39,070 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:39,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:39,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:39,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:39,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:39,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,131 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:39,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:39,131 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:39,142 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:39,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2022]. (let ((.cse2 (select v_main_a_2022 main_y))) (let ((.cse1 (= main_a (store v_main_a_2022 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_2022 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 14) (= .cse2 987))))) [2019-05-15 10:38:39,143 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:38:39,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:39,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:39,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:39,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:39,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,260 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:39,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:39,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:39,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:39,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2023]. (let ((.cse1 (select v_main_a_2023 main_x))) (let ((.cse0 (= (store v_main_a_2023 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 14) (= (select v_main_a_2023 main_y) 986)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:38:39,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:38:39,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:39,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:39,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:39,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:39,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,390 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:39,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:39,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:39,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:39,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2024]. (let ((.cse0 (select v_main_a_2024 main_y))) (let ((.cse1 (= main_a (store v_main_a_2024 main_y (+ .cse0 (- 1))))) (.cse2 (select v_main_a_2024 main_x))) (or (and (= .cse0 986) .cse1 (= .cse2 15)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:38:39,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:39,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:39,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:39,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:39,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:39,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,527 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:39,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:39,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:39,536 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:39,536 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2025]. (let ((.cse1 (select v_main_a_2025 main_x))) (let ((.cse0 (= (store v_main_a_2025 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_2025 main_y) 985) (= 15 .cse1)) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:38:39,536 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:38:39,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:39,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:39,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:39,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:39,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:39,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,667 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:39,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:39,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:39,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:39,688 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2026]. (let ((.cse2 (select v_main_a_2026 main_y))) (let ((.cse0 (= main_a (store v_main_a_2026 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_2026 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 985) (= .cse1 16))))) [2019-05-15 10:38:39,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:39,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:39,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:39,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:39,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:39,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,818 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:39,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:39,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:39,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:39,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2027]. (let ((.cse1 (select v_main_a_2027 main_x))) (let ((.cse0 (= (store v_main_a_2027 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_2027 main_y) 984) (= .cse1 16)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:38:39,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:38:39,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:39,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:39,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:39,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:39,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:39,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:39,942 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:39,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:39,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:39,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:39,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2028]. (let ((.cse2 (select v_main_a_2028 main_y))) (let ((.cse0 (select v_main_a_2028 main_x)) (.cse1 (= (store v_main_a_2028 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 984) (= .cse0 17) .cse1)))) [2019-05-15 10:38:39,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:38:40,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:40,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:40,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:40,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:40,045 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,069 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:40,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:40,069 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:40,082 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:40,083 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2029]. (let ((.cse1 (select v_main_a_2029 main_x))) (let ((.cse0 (= (store v_main_a_2029 main_x (+ .cse1 1)) main_a))) (or (and (= 983 (select v_main_a_2029 main_y)) .cse0 (= 17 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:38:40,083 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:38:40,149 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:40,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:40,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:40,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:40,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:40,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,208 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:40,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:40,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:40,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:40,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2030]. (let ((.cse2 (select v_main_a_2030 main_y))) (let ((.cse0 (select v_main_a_2030 main_x)) (.cse1 (= (store v_main_a_2030 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 18) (= .cse2 983) .cse1)))) [2019-05-15 10:38:40,260 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:40,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:40,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:40,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:40,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:40,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,377 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:40,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:40,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:40,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:40,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2031]. (let ((.cse0 (select v_main_a_2031 main_x))) (let ((.cse1 (= (store v_main_a_2031 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 18) (= (select v_main_a_2031 main_y) 982) .cse1)))) [2019-05-15 10:38:40,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:38:40,460 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:40,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:40,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:40,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:40,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:40,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,506 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:40,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:40,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:40,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:40,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2032]. (let ((.cse2 (select v_main_a_2032 main_y))) (let ((.cse0 (= main_a (store v_main_a_2032 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_2032 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 982) (= .cse1 19))))) [2019-05-15 10:38:40,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:38:40,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:40,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:40,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:40,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:40,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,633 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:40,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:40,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:40,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:40,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2033]. (let ((.cse1 (select v_main_a_2033 main_x))) (let ((.cse0 (= (store v_main_a_2033 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 19) (= (select v_main_a_2033 main_y) 981))))) [2019-05-15 10:38:40,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:38:40,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:40,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:40,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:40,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:40,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,782 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:40,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:40,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:40,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:40,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2034]. (let ((.cse0 (select v_main_a_2034 main_y))) (let ((.cse1 (= (store v_main_a_2034 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_2034 main_x))) (or (and (= .cse0 981) .cse1 (= .cse2 20)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:38:40,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:40,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:40,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:40,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:40,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:40,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:40,935 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:40,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:40,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:40,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:40,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2035]. (let ((.cse0 (select v_main_a_2035 main_x))) (let ((.cse1 (= (store v_main_a_2035 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2035 main_y) 980) (= .cse0 20) .cse1)))) [2019-05-15 10:38:40,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:38:41,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:41,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:41,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:41,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,046 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:41,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:41,048 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,072 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:41,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:41,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:41,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:41,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2036]. (let ((.cse2 (select v_main_a_2036 main_y))) (let ((.cse0 (= (store v_main_a_2036 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2036 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 980) .cse0 (= .cse1 21))))) [2019-05-15 10:38:41,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:41,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:41,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:41,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:41,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:41,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,308 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:41,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:41,308 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:41,320 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:41,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2037]. (let ((.cse1 (select v_main_a_2037 main_x))) (let ((.cse0 (= (store v_main_a_2037 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_2037 main_y) 979) .cse0 (= .cse1 21)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:38:41,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:38:41,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:41,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:41,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:41,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:41,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,450 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:41,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:41,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:41,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:41,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2038]. (let ((.cse0 (select v_main_a_2038 main_y))) (let ((.cse2 (= (store v_main_a_2038 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_2038 main_x))) (or (and (= .cse0 979) (= .cse1 22) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:38:41,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:38:41,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:41,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:41,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:41,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:41,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,609 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:41,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:41,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:41,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:41,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2039]. (let ((.cse0 (select v_main_a_2039 main_x))) (let ((.cse1 (= (store v_main_a_2039 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 22) .cse1 (= (select v_main_a_2039 main_y) 978)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:38:41,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:38:41,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:41,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:41,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:41,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:41,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:41,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,763 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:41,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:41,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:41,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:41,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2040]. (let ((.cse2 (select v_main_a_2040 main_y))) (let ((.cse0 (select v_main_a_2040 main_x)) (.cse1 (= (store v_main_a_2040 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 23) .cse1 (= .cse2 978))))) [2019-05-15 10:38:41,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:41,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:41,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:41,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:41,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:41,928 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:41,952 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:41,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:41,953 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:41,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:41,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2041]. (let ((.cse1 (select v_main_a_2041 main_x))) (let ((.cse0 (= (store v_main_a_2041 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 23) (= (select v_main_a_2041 main_y) 977)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:38:41,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:38:42,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:42,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:42,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:42,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:42,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,098 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:42,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:42,099 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:42,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:42,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2042]. (let ((.cse2 (select v_main_a_2042 main_y))) (let ((.cse0 (= (store v_main_a_2042 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2042 main_x))) (or (and .cse0 (= .cse1 24) (= .cse2 977)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:38:42,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:42,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:42,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:42,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:42,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:42,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,271 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:42,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:42,271 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:42,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:42,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2043]. (let ((.cse0 (select v_main_a_2043 main_x))) (let ((.cse1 (= (store v_main_a_2043 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 24) (= (select v_main_a_2043 main_y) 976) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:38:42,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:38:42,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:42,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:42,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:42,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:42,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:42,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,418 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:42,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:42,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:42,470 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:42,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2044]. (let ((.cse2 (select v_main_a_2044 main_y))) (let ((.cse1 (= (store v_main_a_2044 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2044 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 25) (= .cse2 976))))) [2019-05-15 10:38:42,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:42,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:42,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:42,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:42,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:42,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,604 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:42,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:42,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:42,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:42,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2045]. (let ((.cse1 (select v_main_a_2045 main_x))) (let ((.cse0 (= (store v_main_a_2045 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_2045 main_y) 975) (= .cse1 25))))) [2019-05-15 10:38:42,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:38:42,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:42,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:42,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:42,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:42,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,755 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:42,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:42,755 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:42,828 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:42,828 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2046]. (let ((.cse0 (select v_main_a_2046 main_y))) (let ((.cse1 (select v_main_a_2046 main_x)) (.cse2 (= (store v_main_a_2046 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 975) (= .cse1 26) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:38:42,828 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:42,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:42,938 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:42,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:42,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:42,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:42,971 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:42,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:42,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:42,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:42,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2047]. (let ((.cse1 (select v_main_a_2047 main_x))) (let ((.cse0 (= (store v_main_a_2047 main_x (+ .cse1 1)) main_a))) (or (and (= 974 (select v_main_a_2047 main_y)) .cse0 (= .cse1 26)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:38:42,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:38:43,075 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:43,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:43,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:43,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,097 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:43,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:43,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,124 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:43,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:43,125 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:43,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:43,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2048]. (let ((.cse2 (select v_main_a_2048 main_y))) (let ((.cse1 (= main_a (store v_main_a_2048 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_2048 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 974) (= .cse0 27))))) [2019-05-15 10:38:43,188 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:43,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:43,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:43,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:43,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:43,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,330 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:43,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:43,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:43,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:43,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2049]. (let ((.cse0 (select v_main_a_2049 main_x))) (let ((.cse1 (= (store v_main_a_2049 main_x (+ .cse0 1)) main_a))) (or (and (= 973 (select v_main_a_2049 main_y)) (= 27 .cse0) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:38:43,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:38:43,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:43,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:43,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:43,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:43,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:43,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,482 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:43,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:43,483 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:43,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:43,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2050]. (let ((.cse2 (select v_main_a_2050 main_y))) (let ((.cse0 (select v_main_a_2050 main_x)) (.cse1 (= (store v_main_a_2050 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 973) (= .cse0 28) .cse1)))) [2019-05-15 10:38:43,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:43,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:43,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:43,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,665 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:43,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:43,667 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,692 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:43,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:43,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:43,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:43,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2051]. (let ((.cse1 (select v_main_a_2051 main_x))) (let ((.cse0 (= (store v_main_a_2051 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= (select v_main_a_2051 main_y) 972) (= .cse1 28))))) [2019-05-15 10:38:43,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:38:43,800 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:43,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:43,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:43,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:43,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:43,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:43,850 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:43,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:43,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:43,885 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:43,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2052]. (let ((.cse2 (select v_main_a_2052 main_y))) (let ((.cse1 (= main_a (store v_main_a_2052 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_2052 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 29) (= .cse2 972))))) [2019-05-15 10:38:43,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:43,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:43,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:43,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,007 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:44,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:44,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,035 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:44,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:44,035 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:44,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:44,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2053]. (let ((.cse0 (select v_main_a_2053 main_x))) (let ((.cse1 (= (store v_main_a_2053 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2053 main_y) 971) (= .cse0 29) .cse1)))) [2019-05-15 10:38:44,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:38:44,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:44,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:44,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:44,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:44,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,209 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:44,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:44,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:44,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:44,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2054]. (let ((.cse1 (select v_main_a_2054 main_y))) (let ((.cse2 (= (store v_main_a_2054 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_2054 main_x))) (or (and (= .cse0 30) (= .cse1 971) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:38:44,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:44,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:44,367 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:44,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:44,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:44,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,409 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:44,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:44,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:44,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:44,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2055]. (let ((.cse0 (select v_main_a_2055 main_x))) (let ((.cse1 (= (store v_main_a_2055 main_x (+ .cse0 1)) main_a))) (or (and (= 30 .cse0) (= 970 (select v_main_a_2055 main_y)) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:38:44,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:38:44,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:44,538 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:44,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:44,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:44,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,581 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:44,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:44,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:44,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:44,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2056]. (let ((.cse1 (select v_main_a_2056 main_y))) (let ((.cse2 (= (store v_main_a_2056 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_2056 main_x))) (or (and (= .cse0 31) (= .cse1 970) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:38:44,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:44,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:44,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:44,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:44,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:44,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,816 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:44,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:44,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:44,829 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:44,829 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2057]. (let ((.cse0 (select v_main_a_2057 main_x))) (let ((.cse1 (= main_a (store v_main_a_2057 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= (select v_main_a_2057 main_y) 969) (= 31 .cse0) .cse1)))) [2019-05-15 10:38:44,829 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:38:44,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:44,958 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:44,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:44,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:44,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:44,989 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:44,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:44,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:45,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:45,055 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2058]. (let ((.cse1 (select v_main_a_2058 main_y))) (let ((.cse0 (select v_main_a_2058 main_x)) (.cse2 (= (store v_main_a_2058 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 32) (= .cse1 969) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:38:45,055 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:45,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:45,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:45,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:45,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:45,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,210 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:45,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:45,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:45,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:45,223 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2059]. (let ((.cse1 (select v_main_a_2059 main_x))) (let ((.cse0 (= (store v_main_a_2059 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_2059 main_y) 968) .cse0 (= .cse1 32))))) [2019-05-15 10:38:45,223 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:38:45,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:45,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:45,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:45,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:45,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,371 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:45,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:45,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:45,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:45,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2060]. (let ((.cse0 (select v_main_a_2060 main_y))) (let ((.cse1 (select v_main_a_2060 main_x)) (.cse2 (= (store v_main_a_2060 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 968) (= .cse1 33) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:38:45,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:45,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:45,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:45,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:45,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:45,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,607 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:45,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:45,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:45,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:45,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2061]. (let ((.cse1 (select v_main_a_2061 main_x))) (let ((.cse0 (= (store v_main_a_2061 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_2061 main_y) 967) .cse0 (= .cse1 33))))) [2019-05-15 10:38:45,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:38:45,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:45,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:45,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:45,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:45,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:45,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,784 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:45,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:45,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:45,863 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:45,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2062]. (let ((.cse2 (select v_main_a_2062 main_y))) (let ((.cse1 (= (store v_main_a_2062 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2062 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 967) (= .cse0 34))))) [2019-05-15 10:38:45,864 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:45,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:45,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:45,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:45,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:45,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:45,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,024 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:46,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:46,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:46,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2063]. (let ((.cse1 (select v_main_a_2063 main_x))) (let ((.cse0 (= (store v_main_a_2063 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 966 (select v_main_a_2063 main_y)) .cse0 (= 34 .cse1))))) [2019-05-15 10:38:46,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:38:46,144 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:46,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:46,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:46,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:46,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,192 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:46,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:46,193 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:46,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,201 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2064]. (let ((.cse2 (select v_main_a_2064 main_y))) (let ((.cse0 (= (store v_main_a_2064 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2064 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 966) .cse0 (= .cse1 35))))) [2019-05-15 10:38:46,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:38:46,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:46,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:46,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:46,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,361 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:46,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:46,361 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:46,372 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2065]. (let ((.cse1 (select v_main_a_2065 main_x))) (let ((.cse0 (= (store v_main_a_2065 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 965 (select v_main_a_2065 main_y)) (= 35 .cse1))))) [2019-05-15 10:38:46,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:38:46,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:46,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:46,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:46,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:46,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,536 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:46,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:46,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:46,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2066]. (let ((.cse2 (select v_main_a_2066 main_y))) (let ((.cse1 (= (store v_main_a_2066 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2066 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 965 .cse2) .cse1 (= 36 .cse0))))) [2019-05-15 10:38:46,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:38:46,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:46,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:46,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:46,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,720 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:46,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:46,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:46,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2067]. (let ((.cse1 (select v_main_a_2067 main_x))) (let ((.cse0 (= (store v_main_a_2067 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 36) (= 964 (select v_main_a_2067 main_y)))))) [2019-05-15 10:38:46,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:38:46,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:46,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:46,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:46,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,895 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:46,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:46,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:47,015 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2068]. (let ((.cse2 (select v_main_a_2068 main_y))) (let ((.cse0 (= (store v_main_a_2068 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2068 main_x))) (or (and .cse0 (= .cse1 37) (= .cse2 964)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:38:47,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:47,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:47,148 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:47,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:47,156 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,191 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:47,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:47,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:47,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2069]. (let ((.cse1 (select v_main_a_2069 main_x))) (let ((.cse0 (= (store v_main_a_2069 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_2069 main_y) 963) (= .cse1 37)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:38:47,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:38:47,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:47,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:47,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:47,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:47,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,364 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:47,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:47,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:47,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2070]. (let ((.cse2 (select v_main_a_2070 main_y))) (let ((.cse0 (= (store v_main_a_2070 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2070 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 38) (= .cse2 963))))) [2019-05-15 10:38:47,376 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:38:47,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:47,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:47,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:47,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,548 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:47,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:47,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:47,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2071]. (let ((.cse1 (select v_main_a_2071 main_x))) (let ((.cse0 (= main_a (store v_main_a_2071 main_x (+ .cse1 1))))) (or (and (= 962 (select v_main_a_2071 main_y)) .cse0 (= .cse1 38)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:38:47,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:38:47,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:47,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:47,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:47,702 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,727 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:47,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:47,728 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:47,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2072]. (let ((.cse1 (select v_main_a_2072 main_y))) (let ((.cse0 (= (store v_main_a_2072 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_2072 main_x))) (or (and .cse0 (= 962 .cse1) (= 39 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:38:47,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:47,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:47,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:47,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:47,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,976 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:47,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:47,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:47,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2073]. (let ((.cse0 (select v_main_a_2073 main_x))) (let ((.cse1 (= (store v_main_a_2073 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2073 main_y) 961) (= .cse0 39) .cse1)))) [2019-05-15 10:38:47,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 961) (= .cse0 40)))) [2019-05-15 10:38:48,109 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:48,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:48,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:48,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,131 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:48,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,157 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:48,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:48,158 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:48,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2074]. (let ((.cse2 (select v_main_a_2074 main_y))) (let ((.cse1 (select v_main_a_2074 main_x)) (.cse0 (= (store v_main_a_2074 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 40 .cse1) .cse0 (= .cse2 961))))) [2019-05-15 10:38:48,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:48,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:48,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:48,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:48,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,421 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:48,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:48,422 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:48,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2075]. (let ((.cse1 (select v_main_a_2075 main_x))) (let ((.cse0 (= (store v_main_a_2075 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= 960 (select v_main_a_2075 main_y)) (= .cse1 40))))) [2019-05-15 10:38:48,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 41) (= (select main_a main_y) 960)))) [2019-05-15 10:38:48,556 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:48,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:48,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:48,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:48,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,627 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:48,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:48,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:48,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2076]. (let ((.cse2 (select v_main_a_2076 main_y))) (let ((.cse0 (= (store v_main_a_2076 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2076 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 960) .cse0 (= .cse1 41))))) [2019-05-15 10:38:48,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 959) (= .cse0 41)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:48,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:48,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:48,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:48,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,843 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:48,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:48,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:48,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2077]. (let ((.cse0 (select v_main_a_2077 main_x))) (let ((.cse1 (= (store v_main_a_2077 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_2077 main_y) 959) (= .cse0 41) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:38:48,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 959) (= .cse0 42)))) [2019-05-15 10:38:48,977 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:48,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:48,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:48,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:49,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,022 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:49,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:49,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:49,066 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,066 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2078]. (let ((.cse2 (select v_main_a_2078 main_y))) (let ((.cse0 (select v_main_a_2078 main_x)) (.cse1 (= (store v_main_a_2078 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 42) .cse1 (= .cse2 959))))) [2019-05-15 10:38:49,066 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:49,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:49,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:49,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:38:49,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,245 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:49,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:49,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:49,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2079]. (let ((.cse0 (select v_main_a_2079 main_x))) (let ((.cse1 (= (store v_main_a_2079 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 42) (= (select v_main_a_2079 main_y) 958) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:38:49,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 43) (= (select main_a main_y) 958)))) [2019-05-15 10:38:49,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:49,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:49,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:49,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:49,404 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,428 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:49,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:49,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:49,493 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2080]. (let ((.cse2 (select v_main_a_2080 main_y))) (let ((.cse0 (= (store v_main_a_2080 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2080 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 43) (= .cse2 958))))) [2019-05-15 10:38:49,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:49,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:49,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:49,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:49,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,663 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:49,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:49,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:49,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2081]. (let ((.cse1 (select v_main_a_2081 main_x))) (let ((.cse0 (= main_a (store v_main_a_2081 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 43) (= (select v_main_a_2081 main_y) 957))))) [2019-05-15 10:38:49,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 44) (= (select main_a main_y) 957)))) [2019-05-15 10:38:49,800 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:38:49,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:38:49,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:38:49,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:38:49,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,846 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:38:49,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:38:49,847 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:38:49,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2082]. (let ((.cse2 (select v_main_a_2082 main_y))) (let ((.cse0 (select v_main_a_2082 main_x)) (.cse1 (= (store v_main_a_2082 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 957 .cse2) (= 44 .cse0) .cse1)))) [2019-05-15 10:38:49,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 956) (= .cse0 44)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:38:50,066 INFO L273 TraceCheckUtils]: 0: Hoare triple {17043#true} a := a[x := 0]; {17048#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:38:50,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {17048#(= (select main_a main_x) 0)} a := a[y := 1000]; {17052#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:38:50,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {17052#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {17056#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:38:50,070 INFO L273 TraceCheckUtils]: 3: Hoare triple {17056#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {17060#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,071 INFO L273 TraceCheckUtils]: 4: Hoare triple {17060#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17064#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:38:50,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {17064#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {17068#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {17068#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17072#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:38:50,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {17072#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {17076#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {17076#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17080#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:38:50,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {17080#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {17084#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {17084#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17088#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:38:50,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {17088#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {17092#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {17092#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17096#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:38:50,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {17096#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {17100#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:38:50,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {17100#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {17104#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:38:50,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {17104#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {17108#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:38:50,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {17108#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {17112#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:38:50,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {17112#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {17116#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:38:50,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {17116#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {17120#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:38:50,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {17120#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {17124#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {17124#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17128#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:38:50,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {17128#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {17132#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {17132#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17136#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:38:50,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {17136#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {17140#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:38:50,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {17140#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {17144#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:38:50,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {17144#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {17148#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,096 INFO L273 TraceCheckUtils]: 26: Hoare triple {17148#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17152#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:38:50,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {17152#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {17156#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {17156#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17160#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:38:50,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {17160#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {17164#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:38:50,100 INFO L273 TraceCheckUtils]: 30: Hoare triple {17164#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {17168#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:38:50,101 INFO L273 TraceCheckUtils]: 31: Hoare triple {17168#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {17172#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,103 INFO L273 TraceCheckUtils]: 32: Hoare triple {17172#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17176#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:38:50,104 INFO L273 TraceCheckUtils]: 33: Hoare triple {17176#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {17180#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,105 INFO L273 TraceCheckUtils]: 34: Hoare triple {17180#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17184#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:38:50,106 INFO L273 TraceCheckUtils]: 35: Hoare triple {17184#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {17188#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:38:50,107 INFO L273 TraceCheckUtils]: 36: Hoare triple {17188#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {17192#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:38:50,108 INFO L273 TraceCheckUtils]: 37: Hoare triple {17192#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {17196#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,109 INFO L273 TraceCheckUtils]: 38: Hoare triple {17196#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17200#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:38:50,110 INFO L273 TraceCheckUtils]: 39: Hoare triple {17200#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {17204#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:38:50,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {17204#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {17208#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:38:50,113 INFO L273 TraceCheckUtils]: 41: Hoare triple {17208#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {17212#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,114 INFO L273 TraceCheckUtils]: 42: Hoare triple {17212#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17216#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:38:50,115 INFO L273 TraceCheckUtils]: 43: Hoare triple {17216#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {17220#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {17220#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17224#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:38:50,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {17224#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {17228#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:38:50,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {17228#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {17232#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:38:50,120 INFO L273 TraceCheckUtils]: 47: Hoare triple {17232#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {17236#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,121 INFO L273 TraceCheckUtils]: 48: Hoare triple {17236#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17240#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:38:50,122 INFO L273 TraceCheckUtils]: 49: Hoare triple {17240#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {17244#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {17244#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17248#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:38:50,124 INFO L273 TraceCheckUtils]: 51: Hoare triple {17248#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {17252#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,125 INFO L273 TraceCheckUtils]: 52: Hoare triple {17252#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17256#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:38:50,126 INFO L273 TraceCheckUtils]: 53: Hoare triple {17256#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {17260#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {17260#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17264#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:38:50,129 INFO L273 TraceCheckUtils]: 55: Hoare triple {17264#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {17268#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,130 INFO L273 TraceCheckUtils]: 56: Hoare triple {17268#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17272#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:38:50,131 INFO L273 TraceCheckUtils]: 57: Hoare triple {17272#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {17276#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,132 INFO L273 TraceCheckUtils]: 58: Hoare triple {17276#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17280#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:38:50,133 INFO L273 TraceCheckUtils]: 59: Hoare triple {17280#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {17284#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,134 INFO L273 TraceCheckUtils]: 60: Hoare triple {17284#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17288#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:38:50,135 INFO L273 TraceCheckUtils]: 61: Hoare triple {17288#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {17292#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,137 INFO L273 TraceCheckUtils]: 62: Hoare triple {17292#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17296#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:38:50,138 INFO L273 TraceCheckUtils]: 63: Hoare triple {17296#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {17300#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,139 INFO L273 TraceCheckUtils]: 64: Hoare triple {17300#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17304#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:38:50,140 INFO L273 TraceCheckUtils]: 65: Hoare triple {17304#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {17308#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,141 INFO L273 TraceCheckUtils]: 66: Hoare triple {17308#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17312#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:38:50,142 INFO L273 TraceCheckUtils]: 67: Hoare triple {17312#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {17316#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,144 INFO L273 TraceCheckUtils]: 68: Hoare triple {17316#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17320#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:38:50,145 INFO L273 TraceCheckUtils]: 69: Hoare triple {17320#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {17324#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:38:50,146 INFO L273 TraceCheckUtils]: 70: Hoare triple {17324#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {17328#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:38:50,147 INFO L273 TraceCheckUtils]: 71: Hoare triple {17328#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {17332#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:38:50,148 INFO L273 TraceCheckUtils]: 72: Hoare triple {17332#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {17336#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:38:50,149 INFO L273 TraceCheckUtils]: 73: Hoare triple {17336#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {17340#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:38:50,150 INFO L273 TraceCheckUtils]: 74: Hoare triple {17340#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {17344#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:38:50,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {17344#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {17348#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,153 INFO L273 TraceCheckUtils]: 76: Hoare triple {17348#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17352#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:38:50,154 INFO L273 TraceCheckUtils]: 77: Hoare triple {17352#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {17356#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:38:50,155 INFO L273 TraceCheckUtils]: 78: Hoare triple {17356#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {17360#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:38:50,156 INFO L273 TraceCheckUtils]: 79: Hoare triple {17360#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {17364#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,157 INFO L273 TraceCheckUtils]: 80: Hoare triple {17364#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17368#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} is VALID [2019-05-15 10:38:50,158 INFO L273 TraceCheckUtils]: 81: Hoare triple {17368#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} a := a[y := a[y] - 1]; {17372#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,159 INFO L273 TraceCheckUtils]: 82: Hoare triple {17372#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17376#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} is VALID [2019-05-15 10:38:50,161 INFO L273 TraceCheckUtils]: 83: Hoare triple {17376#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} a := a[y := a[y] - 1]; {17380#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,162 INFO L273 TraceCheckUtils]: 84: Hoare triple {17380#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17384#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} is VALID [2019-05-15 10:38:50,163 INFO L273 TraceCheckUtils]: 85: Hoare triple {17384#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} a := a[y := a[y] - 1]; {17388#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,164 INFO L273 TraceCheckUtils]: 86: Hoare triple {17388#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17392#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} is VALID [2019-05-15 10:38:50,165 INFO L273 TraceCheckUtils]: 87: Hoare triple {17392#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} a := a[y := a[y] - 1]; {17396#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,166 INFO L273 TraceCheckUtils]: 88: Hoare triple {17396#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17400#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 44) (= (select main_a main_y) 957)))} is VALID [2019-05-15 10:38:50,167 INFO L273 TraceCheckUtils]: 89: Hoare triple {17400#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 44) (= (select main_a main_y) 957)))} a := a[y := a[y] - 1]; {17404#(or (and (= (select main_a main_y) 956) (= (select main_a main_x) 44)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:38:50,168 INFO L273 TraceCheckUtils]: 90: Hoare triple {17404#(or (and (= (select main_a main_y) 956) (= (select main_a main_x) 44)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {17044#false} is VALID [2019-05-15 10:38:50,168 INFO L273 TraceCheckUtils]: 91: Hoare triple {17044#false} assume !(a[y] <= 0); {17044#false} is VALID [2019-05-15 10:38:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:38:50,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:38:50,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-15 10:38:50,200 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-05-15 10:38:50,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:38:50,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states. [2019-05-15 10:38:50,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:50,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-05-15 10:38:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-15 10:38:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2019-05-15 10:38:50,325 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-05-15 10:39:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:11,494 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:39:11,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-15 10:39:11,495 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-05-15 10:39:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:39:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-05-15 10:39:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-05-15 10:39:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-05-15 10:39:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-05-15 10:39:11,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2019-05-15 10:39:11,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:11,624 INFO L225 Difference]: With dead ends: 95 [2019-05-15 10:39:11,624 INFO L226 Difference]: Without dead ends: 95 [2019-05-15 10:39:11,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2019-05-15 10:39:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-05-15 10:39:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-05-15 10:39:11,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:39:11,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2019-05-15 10:39:11,626 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2019-05-15 10:39:11,626 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2019-05-15 10:39:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:11,627 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:39:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:39:11,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:11,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:11,628 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2019-05-15 10:39:11,628 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2019-05-15 10:39:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:11,629 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:39:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:39:11,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:11,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:11,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:39:11,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:39:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-05-15 10:39:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-05-15 10:39:11,631 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-05-15 10:39:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:39:11,631 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-05-15 10:39:11,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-05-15 10:39:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:39:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-05-15 10:39:11,632 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:39:11,632 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-05-15 10:39:11,632 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:39:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:39:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash -171218032, now seen corresponding path program 45 times [2019-05-15 10:39:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:39:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:11,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-15 10:39:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:11,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:39:11,799 INFO L375 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 6 treesize of output 5 [2019-05-15 10:39:11,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:11,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:39:11,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:11,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2083]. (= main_a (store v_main_a_2083 main_x 0)) [2019-05-15 10:39:11,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:39:11,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:11,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:39:11,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,847 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:39:11,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:39:11,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:11,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2084]. (and (= (store v_main_a_2084 main_y 1000) main_a) (= 0 (select v_main_a_2084 main_x))) [2019-05-15 10:39:11,851 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_y) 1000) (or (= main_y main_x) (= (select main_a main_x) 0))) [2019-05-15 10:39:11,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:11,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:11,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:11,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:11,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,926 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:11,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:11,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:11,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:11,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2085]. (let ((.cse2 (select v_main_a_2085 main_x))) (let ((.cse0 (= (select v_main_a_2085 main_y) 1000)) (.cse1 (= (store v_main_a_2085 main_x (+ .cse2 1)) main_a))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= main_y main_x) .cse0 .cse1)))) [2019-05-15 10:39:11,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:39:11,967 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:11,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:11,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:11,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,990 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:11,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:11,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,018 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2086]. (let ((.cse2 (select v_main_a_2086 main_y))) (let ((.cse0 (select v_main_a_2086 main_x)) (.cse1 (= main_a (store v_main_a_2086 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 1) .cse1 (= .cse2 1000))))) [2019-05-15 10:39:12,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:12,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:12,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:12,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,128 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2087]. (let ((.cse1 (select v_main_a_2087 main_x))) (let ((.cse0 (= (store v_main_a_2087 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_2087 main_y) 999) (= .cse1 1)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:12,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:39:12,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,189 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:12,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:12,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,234 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2088]. (let ((.cse0 (select v_main_a_2088 main_y))) (let ((.cse1 (= (store v_main_a_2088 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_2088 main_x))) (or (and (= .cse0 999) .cse1 (= .cse2 2)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:39:12,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:12,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:12,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:12,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,338 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2089]. (let ((.cse1 (select v_main_a_2089 main_x))) (let ((.cse0 (= (store v_main_a_2089 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_2089 main_y) 998) .cse0 (= .cse1 2)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:12,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:39:12,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:12,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:12,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:12,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,434 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2090]. (let ((.cse2 (select v_main_a_2090 main_y))) (let ((.cse0 (= main_a (store v_main_a_2090 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_2090 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 998) (= .cse1 3))))) [2019-05-15 10:39:12,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:12,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:12,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,527 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:12,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,553 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,568 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2091]. (let ((.cse1 (select v_main_a_2091 main_x))) (let ((.cse0 (= (store v_main_a_2091 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 997 (select v_main_a_2091 main_y)) .cse0 (= .cse1 3))))) [2019-05-15 10:39:12,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:39:12,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:12,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:12,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,657 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,657 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,688 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2092]. (let ((.cse0 (select v_main_a_2092 main_y))) (let ((.cse2 (select v_main_a_2092 main_x)) (.cse1 (= (store v_main_a_2092 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 997) .cse1 (= .cse2 4)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:39:12,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:12,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:12,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:12,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,791 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2093]. (let ((.cse0 (select v_main_a_2093 main_x))) (let ((.cse1 (= (store v_main_a_2093 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_2093 main_y) 996) (= .cse0 4) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:12,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:39:12,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:12,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:12,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,893 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:12,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:12,894 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:12,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2094]. (let ((.cse1 (select v_main_a_2094 main_y))) (let ((.cse0 (= (store v_main_a_2094 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_2094 main_x))) (or (and .cse0 (= .cse1 996) (= .cse2 5)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:39:12,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:12,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:12,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:12,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,026 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,026 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:13,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2095]. (let ((.cse1 (select v_main_a_2095 main_x))) (let ((.cse0 (= (store v_main_a_2095 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_2095 main_y) 995) (= .cse1 5))))) [2019-05-15 10:39:13,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:39:13,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:13,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:13,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,145 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:13,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2096]. (let ((.cse0 (select v_main_a_2096 main_y))) (let ((.cse2 (select v_main_a_2096 main_x)) (.cse1 (= (store v_main_a_2096 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 995) .cse1 (= .cse2 6)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:39:13,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:13,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:13,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:13,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,293 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:13,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2097]. (let ((.cse1 (select v_main_a_2097 main_x))) (let ((.cse0 (= (store v_main_a_2097 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_2097 main_y) 994) (= .cse1 6)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:13,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:39:13,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:13,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:13,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:13,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,398 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:13,409 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,409 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2098]. (let ((.cse2 (select v_main_a_2098 main_y))) (let ((.cse1 (select v_main_a_2098 main_x)) (.cse0 (= (store v_main_a_2098 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= 994 .cse2) (= .cse1 7) .cse0)))) [2019-05-15 10:39:13,409 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:39:13,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:13,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:13,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,506 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:13,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,516 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2099]. (let ((.cse1 (select v_main_a_2099 main_x))) (let ((.cse0 (= main_a (store v_main_a_2099 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 993 (select v_main_a_2099 main_y)) .cse0 (= 7 .cse1))))) [2019-05-15 10:39:13,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:39:13,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:13,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:13,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,615 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:13,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2100]. (let ((.cse2 (select v_main_a_2100 main_y))) (let ((.cse0 (= (store v_main_a_2100 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2100 main_x))) (or (and .cse0 (= .cse1 8) (= .cse2 993)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:39:13,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 8) (= (select main_a main_y) 992)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:13,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:13,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:13,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,744 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,744 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:13,756 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,756 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2101]. (let ((.cse1 (select v_main_a_2101 main_x))) (let ((.cse0 (= main_a (store v_main_a_2101 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_2101 main_y) 992) .cse0 (= .cse1 8))))) [2019-05-15 10:39:13,756 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:39:13,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:13,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:13,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:13,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,857 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:13,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2102]. (let ((.cse2 (select v_main_a_2102 main_y))) (let ((.cse0 (select v_main_a_2102 main_x)) (.cse1 (= (store v_main_a_2102 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 9) .cse1 (= .cse2 992))))) [2019-05-15 10:39:13,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:39:13,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:13,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:13,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:13,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,998 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:13,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:13,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:14,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2103]. (let ((.cse1 (select v_main_a_2103 main_x))) (let ((.cse0 (= main_a (store v_main_a_2103 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 9) (= (select v_main_a_2103 main_y) 991))))) [2019-05-15 10:39:14,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:39:14,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:14,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:14,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:14,094 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,120 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:14,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:14,121 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:14,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2104]. (let ((.cse0 (select v_main_a_2104 main_y))) (let ((.cse2 (select v_main_a_2104 main_x)) (.cse1 (= (store v_main_a_2104 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 991 .cse0) .cse1 (= 10 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:39:14,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:14,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:14,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:14,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,221 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:14,223 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,249 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:14,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:14,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:14,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2105]. (let ((.cse0 (select v_main_a_2105 main_x))) (let ((.cse1 (= (store v_main_a_2105 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2105 main_y) 990) (= .cse0 10) .cse1)))) [2019-05-15 10:39:14,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:39:14,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:14,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:14,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:14,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,369 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:14,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:14,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:14,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2106]. (let ((.cse2 (select v_main_a_2106 main_y))) (let ((.cse0 (= (store v_main_a_2106 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2106 main_x))) (or (and .cse0 (= .cse1 11) (= .cse2 990)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:39:14,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:39:14,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:14,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:14,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:14,461 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,487 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:14,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:14,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:14,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2107]. (let ((.cse1 (select v_main_a_2107 main_x))) (let ((.cse0 (= main_a (store v_main_a_2107 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_2107 main_y) 989) (= .cse1 11)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:39:14,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:39:14,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:14,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:14,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:14,589 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,615 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:14,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:14,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:14,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2108]. (let ((.cse0 (select v_main_a_2108 main_y))) (let ((.cse2 (= (store v_main_a_2108 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_2108 main_x))) (or (and (= .cse0 989) (= .cse1 12) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:39:14,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:14,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:14,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:14,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:14,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,799 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:14,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:14,799 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:14,812 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2109]. (let ((.cse0 (select v_main_a_2109 main_x))) (let ((.cse1 (= (store v_main_a_2109 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 12) .cse1 (= (select v_main_a_2109 main_y) 988))))) [2019-05-15 10:39:14,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:39:14,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:14,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:14,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:14,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:14,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,952 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:14,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:14,953 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:15,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2110]. (let ((.cse2 (select v_main_a_2110 main_y))) (let ((.cse0 (= (store v_main_a_2110 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2110 main_x))) (or (and .cse0 (= main_y main_x) (= 1001 .cse1)) (and .cse0 (= .cse2 988) (= 13 .cse1))))) [2019-05-15 10:39:15,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:15,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:15,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:15,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:15,097 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,122 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:15,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:15,123 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:15,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2111]. (let ((.cse0 (select v_main_a_2111 main_x))) (let ((.cse1 (= (store v_main_a_2111 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 987 (select v_main_a_2111 main_y)) (= 13 .cse0) .cse1)))) [2019-05-15 10:39:15,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:39:15,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:15,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:15,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:15,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,256 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:15,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:15,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:15,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2112]. (let ((.cse0 (select v_main_a_2112 main_y))) (let ((.cse1 (= (store v_main_a_2112 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_2112 main_x))) (or (and (= .cse0 987) .cse1 (= .cse2 14)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:39:15,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:39:15,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:15,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:15,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,350 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:15,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,377 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:15,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:15,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:15,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2113]. (let ((.cse1 (select v_main_a_2113 main_x))) (let ((.cse0 (= (store v_main_a_2113 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 14) .cse0 (= (select v_main_a_2113 main_y) 986))))) [2019-05-15 10:39:15,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:39:15,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:15,473 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:15,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:15,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,504 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:15,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:15,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:15,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2114]. (let ((.cse0 (select v_main_a_2114 main_y))) (let ((.cse1 (= (store v_main_a_2114 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_2114 main_x))) (or (and (= 986 .cse0) .cse1 (= 15 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse2))))) [2019-05-15 10:39:15,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:15,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:15,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:15,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:15,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,650 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:15,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:15,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:15,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2115]. (let ((.cse0 (select v_main_a_2115 main_x))) (let ((.cse1 (= main_a (store v_main_a_2115 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 15) (= (select v_main_a_2115 main_y) 985) .cse1)))) [2019-05-15 10:39:15,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:39:15,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:15,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:15,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:15,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,756 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:15,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,795 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:15,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:15,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:15,840 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2116]. (let ((.cse2 (select v_main_a_2116 main_y))) (let ((.cse1 (= (store v_main_a_2116 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2116 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 985) .cse1 (= .cse0 16))))) [2019-05-15 10:39:15,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:15,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:15,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:15,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:15,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,957 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:15,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:15,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:15,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2117]. (let ((.cse0 (select v_main_a_2117 main_x))) (let ((.cse1 (= main_a (store v_main_a_2117 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 16) .cse1 (= (select v_main_a_2117 main_y) 984))))) [2019-05-15 10:39:15,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:39:16,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:16,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:16,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:16,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:16,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,087 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:16,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:16,087 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:16,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2118]. (let ((.cse2 (select v_main_a_2118 main_y))) (let ((.cse0 (= main_a (store v_main_a_2118 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_2118 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 984) .cse0 (= .cse1 17))))) [2019-05-15 10:39:16,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:39:16,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:16,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:16,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:16,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,215 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:16,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:16,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:16,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2119]. (let ((.cse1 (select v_main_a_2119 main_x))) (let ((.cse0 (= (store v_main_a_2119 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 17) (= (select v_main_a_2119 main_y) 983)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:16,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:39:16,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:16,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:16,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:16,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:16,323 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,359 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:16,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:16,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:16,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2120]. (let ((.cse2 (select v_main_a_2120 main_y))) (let ((.cse0 (select v_main_a_2120 main_x)) (.cse1 (= (store v_main_a_2120 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 983 .cse2) (= 18 .cse0) .cse1)))) [2019-05-15 10:39:16,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:16,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:16,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:16,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:16,496 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,521 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:16,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:16,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:16,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2121]. (let ((.cse0 (select v_main_a_2121 main_x))) (let ((.cse1 (= (store v_main_a_2121 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_2121 main_y) 982) (= .cse0 18) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:16,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:39:16,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:16,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:16,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:16,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,659 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:16,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:16,660 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:16,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2122]. (let ((.cse2 (select v_main_a_2122 main_y))) (let ((.cse0 (= (store v_main_a_2122 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2122 main_x))) (or (and .cse0 (= .cse1 19) (= .cse2 982)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:39:16,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:39:16,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:16,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:16,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:16,766 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,792 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:16,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:16,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:16,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2123]. (let ((.cse0 (select v_main_a_2123 main_x))) (let ((.cse1 (= (store v_main_a_2123 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 19) (= (select v_main_a_2123 main_y) 981) .cse1)))) [2019-05-15 10:39:16,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:39:16,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:16,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:16,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:16,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,940 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:16,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:16,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:17,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:17,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2124]. (let ((.cse1 (select v_main_a_2124 main_y))) (let ((.cse0 (select v_main_a_2124 main_x)) (.cse2 (= (store v_main_a_2124 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 20 .cse0) (= 981 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:39:17,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:17,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:17,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:17,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:17,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:17,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,137 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:17,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:17,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:17,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:17,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2125]. (let ((.cse1 (select v_main_a_2125 main_x))) (let ((.cse0 (= (store v_main_a_2125 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 20 .cse1) (= (select v_main_a_2125 main_y) 980)) (and .cse0 (= main_y main_x) (= 1000 .cse1))))) [2019-05-15 10:39:17,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:39:17,225 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:17,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:17,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:17,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:17,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:17,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,274 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:17,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:17,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:17,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:17,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2126]. (let ((.cse2 (select v_main_a_2126 main_y))) (let ((.cse0 (= main_a (store v_main_a_2126 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_2126 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 980 .cse2) (= 21 .cse1))))) [2019-05-15 10:39:17,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:17,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:17,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:17,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:17,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:17,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,523 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:17,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:17,524 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:17,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:17,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2127]. (let ((.cse1 (select v_main_a_2127 main_x))) (let ((.cse0 (= (store v_main_a_2127 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 979 (select v_main_a_2127 main_y)) (= 21 .cse1)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:39:17,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:39:17,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:17,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:17,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:17,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:17,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,680 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:17,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:17,681 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:17,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:17,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2128]. (let ((.cse0 (select v_main_a_2128 main_y))) (let ((.cse1 (select v_main_a_2128 main_x)) (.cse2 (= (store v_main_a_2128 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 979) (= .cse1 22) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:39:17,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:39:17,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:17,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:17,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:17,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:17,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,825 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:17,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:17,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:17,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:17,839 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2129]. (let ((.cse1 (select v_main_a_2129 main_x))) (let ((.cse0 (= (store v_main_a_2129 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_2129 main_y) 978) .cse0 (= .cse1 22)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:17,839 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:39:17,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:17,941 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:17,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:17,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:17,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:17,985 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:17,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:17,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:18,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:18,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2130]. (let ((.cse0 (select v_main_a_2130 main_y))) (let ((.cse2 (= (store v_main_a_2130 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_2130 main_x))) (or (and (= .cse0 978) (= .cse1 23) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:39:18,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:18,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:18,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:18,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:18,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:18,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,140 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:18,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:18,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:18,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:18,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2131]. (let ((.cse0 (select v_main_a_2131 main_x))) (let ((.cse1 (= (store v_main_a_2131 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 23) .cse1 (= (select v_main_a_2131 main_y) 977)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:39:18,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:39:18,245 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:18,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:18,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:18,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,266 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:18,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:18,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,292 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:18,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:18,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:18,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:18,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2132]. (let ((.cse2 (select v_main_a_2132 main_y))) (let ((.cse0 (= (store v_main_a_2132 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2132 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 977 .cse2) .cse0 (= 24 .cse1))))) [2019-05-15 10:39:18,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:18,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:18,482 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:18,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:18,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:18,487 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,523 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:18,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:18,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:18,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:18,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2133]. (let ((.cse1 (select v_main_a_2133 main_x))) (let ((.cse0 (= (store v_main_a_2133 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_2133 main_y) 976) .cse0 (= .cse1 24)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:39:18,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:39:18,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:18,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:18,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:18,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:18,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,665 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:18,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:18,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:18,739 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:18,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2134]. (let ((.cse2 (select v_main_a_2134 main_y))) (let ((.cse1 (= (store v_main_a_2134 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2134 main_x))) (or (and (= 25 .cse0) .cse1 (= 976 .cse2)) (and (= main_y main_x) .cse1 (= 1001 .cse0))))) [2019-05-15 10:39:18,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:18,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:18,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:18,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,840 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:18,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:18,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,866 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:18,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:18,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:18,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:18,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2135]. (let ((.cse0 (select v_main_a_2135 main_x))) (let ((.cse1 (= (store v_main_a_2135 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 25) (= (select v_main_a_2135 main_y) 975) .cse1)))) [2019-05-15 10:39:18,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:39:18,968 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:18,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:18,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:18,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:18,990 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:18,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:18,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,027 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:19,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:19,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:19,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:19,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2136]. (let ((.cse2 (select v_main_a_2136 main_y))) (let ((.cse1 (= (store v_main_a_2136 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2136 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 975) .cse1 (= .cse0 26))))) [2019-05-15 10:39:19,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:19,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:19,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:19,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:19,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:19,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,221 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:19,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:19,222 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:19,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:19,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2137]. (let ((.cse0 (select v_main_a_2137 main_x))) (let ((.cse1 (= main_a (store v_main_a_2137 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2137 main_y) 974) (= .cse0 26) .cse1)))) [2019-05-15 10:39:19,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:39:19,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:19,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:19,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:19,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:19,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:19,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,371 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:19,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:19,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:19,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:19,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2138]. (let ((.cse2 (select v_main_a_2138 main_y))) (let ((.cse0 (= (store v_main_a_2138 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2138 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 974 .cse2) .cse0 (= 27 .cse1))))) [2019-05-15 10:39:19,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:19,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:19,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:19,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:19,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:19,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,584 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:19,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:19,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:19,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:19,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2139]. (let ((.cse1 (select v_main_a_2139 main_x))) (let ((.cse0 (= (store v_main_a_2139 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 27 .cse1) (= 973 (select v_main_a_2139 main_y)))))) [2019-05-15 10:39:19,596 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:39:19,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:19,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:19,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:19,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:19,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,735 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:19,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:19,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:19,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:19,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2140]. (let ((.cse1 (select v_main_a_2140 main_y))) (let ((.cse0 (select v_main_a_2140 main_x)) (.cse2 (= (store v_main_a_2140 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 28) (= .cse1 973) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:39:19,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:19,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:19,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:19,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,920 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:19,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:19,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:19,946 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:19,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:19,947 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:19,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:19,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2141]. (let ((.cse1 (select v_main_a_2141 main_x))) (let ((.cse0 (= (store v_main_a_2141 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_2141 main_y) 972) (= .cse1 28))))) [2019-05-15 10:39:19,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:39:20,053 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:20,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:20,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:20,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:20,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:20,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,101 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:20,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:20,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:20,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:20,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2142]. (let ((.cse2 (select v_main_a_2142 main_y))) (let ((.cse0 (= (store v_main_a_2142 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2142 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 972) .cse0 (= .cse1 29))))) [2019-05-15 10:39:20,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:20,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:20,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:20,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,244 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:20,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:20,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,270 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:20,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:20,271 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:20,280 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:20,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2143]. (let ((.cse1 (select v_main_a_2143 main_x))) (let ((.cse0 (= main_a (store v_main_a_2143 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 29) (= (select v_main_a_2143 main_y) 971) .cse0)))) [2019-05-15 10:39:20,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:39:20,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:20,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:20,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:20,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:20,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,440 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:20,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:20,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:20,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:20,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2144]. (let ((.cse1 (select v_main_a_2144 main_y))) (let ((.cse0 (= main_a (store v_main_a_2144 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_2144 main_x))) (or (and .cse0 (= .cse1 971) (= .cse2 30)) (and .cse0 (= main_y main_x) (= .cse2 1001))))) [2019-05-15 10:39:20,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:20,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:20,665 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:20,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:20,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:20,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,707 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:20,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:20,708 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:20,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:20,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2145]. (let ((.cse0 (select v_main_a_2145 main_x))) (let ((.cse1 (= (store v_main_a_2145 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 30) .cse1 (= (select v_main_a_2145 main_y) 970)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:39:20,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:39:20,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:20,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:20,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:20,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:20,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:20,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:20,878 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:20,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:20,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:20,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:20,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2146]. (let ((.cse2 (select v_main_a_2146 main_y))) (let ((.cse1 (= (store v_main_a_2146 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2146 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse2 970) (= .cse0 31))))) [2019-05-15 10:39:20,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:21,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:21,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:21,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:21,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:21,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,093 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:21,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:21,094 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:21,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:21,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2147]. (let ((.cse0 (select v_main_a_2147 main_x))) (let ((.cse1 (= (store v_main_a_2147 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 31) (= (select v_main_a_2147 main_y) 969) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:21,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:39:21,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:21,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:21,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:21,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:21,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,252 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:21,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:21,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:21,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:21,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2148]. (let ((.cse1 (select v_main_a_2148 main_y))) (let ((.cse0 (= (store v_main_a_2148 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_2148 main_x))) (or (and .cse0 (= .cse1 969) (= .cse2 32)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:39:21,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:21,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:21,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:21,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:21,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:21,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,505 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:21,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:21,506 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:21,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:21,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2149]. (let ((.cse0 (select v_main_a_2149 main_x))) (let ((.cse1 (= (store v_main_a_2149 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= (select v_main_a_2149 main_y) 968) (= .cse0 32))))) [2019-05-15 10:39:21,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:39:21,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:21,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:21,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:21,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:21,650 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,674 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:21,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:21,675 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:21,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:21,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2150]. (let ((.cse1 (select v_main_a_2150 main_y))) (let ((.cse0 (= (store v_main_a_2150 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_2150 main_x))) (or (and .cse0 (= 968 .cse1) (= 33 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse2))))) [2019-05-15 10:39:21,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:21,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:21,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:21,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:21,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:21,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:21,880 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:21,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:21,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:21,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:21,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2151]. (let ((.cse1 (select v_main_a_2151 main_x))) (let ((.cse0 (= (store v_main_a_2151 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_2151 main_y) 967) (= .cse1 33) .cse0)))) [2019-05-15 10:39:21,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:39:21,995 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:21,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:21,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:21,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:22,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:22,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,053 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:22,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:22,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:22,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:22,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2152]. (let ((.cse2 (select v_main_a_2152 main_y))) (let ((.cse0 (select v_main_a_2152 main_x)) (.cse1 (= (store v_main_a_2152 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 34) .cse1 (= 967 .cse2))))) [2019-05-15 10:39:22,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:22,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:22,198 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:22,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:22,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:22,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,239 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:22,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:22,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:22,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:22,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2153]. (let ((.cse0 (select v_main_a_2153 main_x))) (let ((.cse1 (= (store v_main_a_2153 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 34) (= (select v_main_a_2153 main_y) 966) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:22,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:39:22,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:22,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:22,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:22,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:22,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:22,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,402 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:22,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:22,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:22,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:22,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2154]. (let ((.cse2 (select v_main_a_2154 main_y))) (let ((.cse0 (select v_main_a_2154 main_x)) (.cse1 (= (store v_main_a_2154 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 35) (= .cse2 966) .cse1)))) [2019-05-15 10:39:22,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:39:22,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:22,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:22,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,542 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:22,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:22,544 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,568 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:22,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:22,569 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:22,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:22,580 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2155]. (let ((.cse0 (select v_main_a_2155 main_x))) (let ((.cse1 (= (store v_main_a_2155 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= 965 (select v_main_a_2155 main_y)) .cse1 (= .cse0 35))))) [2019-05-15 10:39:22,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:39:22,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:22,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:22,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:22,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:22,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,738 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:22,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:22,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:22,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:22,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2156]. (let ((.cse0 (select v_main_a_2156 main_y))) (let ((.cse1 (select v_main_a_2156 main_x)) (.cse2 (= (store v_main_a_2156 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 965) (= .cse1 36) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:39:22,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:39:22,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:22,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:22,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:22,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:22,880 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:22,904 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:22,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:22,905 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:22,917 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:22,917 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2157]. (let ((.cse0 (select v_main_a_2157 main_x))) (let ((.cse1 (= (store v_main_a_2157 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2157 main_y) 964) .cse1 (= .cse0 36))))) [2019-05-15 10:39:22,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:39:23,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:23,046 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:23,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:23,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:23,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,078 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:23,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:23,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:23,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:23,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2158]. (let ((.cse1 (select v_main_a_2158 main_y))) (let ((.cse2 (select v_main_a_2158 main_x)) (.cse0 (= main_a (store v_main_a_2158 main_y (+ .cse1 (- 1)))))) (or (and .cse0 (= 964 .cse1) (= 37 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse0)))) [2019-05-15 10:39:23,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:23,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:23,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:23,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:23,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:23,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,301 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:23,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:23,301 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:23,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:23,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2159]. (let ((.cse0 (select v_main_a_2159 main_x))) (let ((.cse1 (= main_a (store v_main_a_2159 main_x (+ .cse0 1))))) (or (and (= (select v_main_a_2159 main_y) 963) (= .cse0 37) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:39:23,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:39:23,427 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:23,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:23,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:23,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,449 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:23,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:23,451 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,473 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:23,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:23,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:23,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:23,486 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2160]. (let ((.cse2 (select v_main_a_2160 main_y))) (let ((.cse0 (= (store v_main_a_2160 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2160 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 38 .cse1) (= .cse2 963))))) [2019-05-15 10:39:23,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:39:23,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:23,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:23,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:23,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:23,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,657 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:23,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:23,658 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:23,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:23,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2161]. (let ((.cse1 (select v_main_a_2161 main_x))) (let ((.cse0 (= (store v_main_a_2161 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= (select v_main_a_2161 main_y) 962) (= .cse1 38))))) [2019-05-15 10:39:23,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:39:23,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:23,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:23,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:23,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:23,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:23,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:23,839 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:23,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:23,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:23,908 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:23,908 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2162]. (let ((.cse2 (select v_main_a_2162 main_y))) (let ((.cse0 (= (store v_main_a_2162 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2162 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 962) (= .cse1 39))))) [2019-05-15 10:39:23,908 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:24,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:24,052 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:24,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:24,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:24,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,082 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:24,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:24,083 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:24,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:24,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2163]. (let ((.cse0 (select v_main_a_2163 main_x))) (let ((.cse1 (= (store v_main_a_2163 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_2163 main_y) 961) (= .cse0 39) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:24,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 961) (= .cse0 40)))) [2019-05-15 10:39:24,207 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:24,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:24,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:24,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:24,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:24,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,252 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:24,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:24,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:24,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:24,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2164]. (let ((.cse2 (select v_main_a_2164 main_y))) (let ((.cse0 (select v_main_a_2164 main_x)) (.cse1 (= main_a (store v_main_a_2164 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 961) (= .cse0 40) .cse1)))) [2019-05-15 10:39:24,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:24,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:24,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:24,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:24,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:24,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,482 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:24,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:24,483 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:24,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:24,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2165]. (let ((.cse0 (select v_main_a_2165 main_x))) (let ((.cse1 (= (store v_main_a_2165 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2165 main_y) 960) (= .cse0 40) .cse1)))) [2019-05-15 10:39:24,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 41) (= (select main_a main_y) 960)))) [2019-05-15 10:39:24,612 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:24,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:24,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:24,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:24,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:24,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,670 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:24,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:24,671 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:24,722 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:24,722 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2166]. (let ((.cse2 (select v_main_a_2166 main_y))) (let ((.cse0 (= (store v_main_a_2166 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2166 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 41) (= .cse2 960))))) [2019-05-15 10:39:24,722 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 959) (= .cse0 41)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:24,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:24,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:24,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:24,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:24,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:24,888 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:24,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:24,888 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:24,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:24,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2167]. (let ((.cse0 (select v_main_a_2167 main_x))) (let ((.cse1 (= (store v_main_a_2167 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 41) .cse1 (= (select v_main_a_2167 main_y) 959))))) [2019-05-15 10:39:24,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 959) (= .cse0 42)))) [2019-05-15 10:39:25,016 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:25,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:25,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:25,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:25,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:25,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,061 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:25,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:25,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:25,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:25,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2168]. (let ((.cse2 (select v_main_a_2168 main_y))) (let ((.cse0 (= main_a (store v_main_a_2168 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_2168 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 42) (= .cse2 959))))) [2019-05-15 10:39:25,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:25,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:25,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:25,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:25,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:25,247 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,283 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:25,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:25,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:25,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:25,297 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2169]. (let ((.cse0 (select v_main_a_2169 main_x))) (let ((.cse1 (= (store v_main_a_2169 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2169 main_y) 958) .cse1 (= .cse0 42))))) [2019-05-15 10:39:25,297 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 43) (= (select main_a main_y) 958)))) [2019-05-15 10:39:25,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:25,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:25,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:25,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:25,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,466 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:25,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:25,466 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:25,536 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:25,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2170]. (let ((.cse2 (select v_main_a_2170 main_y))) (let ((.cse1 (= (store v_main_a_2170 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2170 main_x))) (or (and (= .cse0 43) .cse1 (= 958 .cse2)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:39:25,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:25,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:25,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:25,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:25,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:25,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,713 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:25,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:25,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:25,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:25,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2171]. (let ((.cse1 (select v_main_a_2171 main_x))) (let ((.cse0 (= main_a (store v_main_a_2171 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_2171 main_y) 957) .cse0 (= .cse1 43)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:39:25,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 44) (= (select main_a main_y) 957)))) [2019-05-15 10:39:25,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:25,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:25,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:25,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:25,877 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:25,901 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:25,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:25,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:25,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:25,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2172]. (let ((.cse0 (select v_main_a_2172 main_y))) (let ((.cse2 (select v_main_a_2172 main_x)) (.cse1 (= (store v_main_a_2172 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 957 .cse0) .cse1 (= 44 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:39:25,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 956) (= .cse0 44)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:26,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:26,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:26,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:26,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,141 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:26,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:26,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:26,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2173]. (let ((.cse0 (select v_main_a_2173 main_x))) (let ((.cse1 (= (store v_main_a_2173 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 44) (= (select v_main_a_2173 main_y) 956) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:26,156 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 956) (= .cse0 45)))) [2019-05-15 10:39:26,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:26,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:26,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:26,315 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,350 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:26,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:26,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:26,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,411 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2174]. (let ((.cse0 (select v_main_a_2174 main_y))) (let ((.cse2 (select v_main_a_2174 main_x)) (.cse1 (= main_a (store v_main_a_2174 main_y (+ .cse0 (- 1)))))) (or (and (= 956 .cse0) .cse1 (= 45 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:39:26,411 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 955) (= .cse0 45)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:26,534 INFO L273 TraceCheckUtils]: 0: Hoare triple {17790#true} a := a[x := 0]; {17795#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:39:26,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {17795#(= (select main_a main_x) 0)} a := a[y := 1000]; {17799#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:39:26,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {17799#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {17803#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:39:26,537 INFO L273 TraceCheckUtils]: 3: Hoare triple {17803#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {17807#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,538 INFO L273 TraceCheckUtils]: 4: Hoare triple {17807#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17811#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:39:26,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {17811#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {17815#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {17815#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17819#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:39:26,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {17819#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {17823#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {17823#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17827#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:39:26,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {17827#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {17831#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {17831#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17835#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:39:26,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {17835#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {17839#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {17839#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17843#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:39:26,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {17843#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {17847#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:39:26,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {17847#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {17851#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:39:26,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {17851#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {17855#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:39:26,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {17855#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {17859#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:39:26,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {17859#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {17863#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:39:26,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {17863#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {17867#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:39:26,556 INFO L273 TraceCheckUtils]: 19: Hoare triple {17867#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {17871#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,557 INFO L273 TraceCheckUtils]: 20: Hoare triple {17871#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17875#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:39:26,558 INFO L273 TraceCheckUtils]: 21: Hoare triple {17875#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {17879#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {17879#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17883#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:39:26,560 INFO L273 TraceCheckUtils]: 23: Hoare triple {17883#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {17887#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:39:26,561 INFO L273 TraceCheckUtils]: 24: Hoare triple {17887#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {17891#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:39:26,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {17891#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {17895#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {17895#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17899#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:39:26,565 INFO L273 TraceCheckUtils]: 27: Hoare triple {17899#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {17903#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,566 INFO L273 TraceCheckUtils]: 28: Hoare triple {17903#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17907#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:39:26,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {17907#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {17911#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:39:26,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {17911#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {17915#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:39:26,569 INFO L273 TraceCheckUtils]: 31: Hoare triple {17915#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {17919#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,570 INFO L273 TraceCheckUtils]: 32: Hoare triple {17919#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17923#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:39:26,571 INFO L273 TraceCheckUtils]: 33: Hoare triple {17923#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {17927#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {17927#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17931#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:39:26,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {17931#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {17935#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:39:26,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {17935#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {17939#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:39:26,576 INFO L273 TraceCheckUtils]: 37: Hoare triple {17939#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {17943#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {17943#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17947#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:39:26,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {17947#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {17951#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:39:26,579 INFO L273 TraceCheckUtils]: 40: Hoare triple {17951#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {17955#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:39:26,580 INFO L273 TraceCheckUtils]: 41: Hoare triple {17955#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {17959#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,582 INFO L273 TraceCheckUtils]: 42: Hoare triple {17959#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17963#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:39:26,583 INFO L273 TraceCheckUtils]: 43: Hoare triple {17963#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {17967#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,584 INFO L273 TraceCheckUtils]: 44: Hoare triple {17967#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17971#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:39:26,585 INFO L273 TraceCheckUtils]: 45: Hoare triple {17971#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {17975#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:39:26,586 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {17979#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:39:26,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {17979#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {17983#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,588 INFO L273 TraceCheckUtils]: 48: Hoare triple {17983#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17987#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:39:26,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {17987#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {17991#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {17991#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {17995#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:39:26,592 INFO L273 TraceCheckUtils]: 51: Hoare triple {17995#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {17999#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,593 INFO L273 TraceCheckUtils]: 52: Hoare triple {17999#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18003#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:39:26,594 INFO L273 TraceCheckUtils]: 53: Hoare triple {18003#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {18007#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,595 INFO L273 TraceCheckUtils]: 54: Hoare triple {18007#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18011#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:39:26,596 INFO L273 TraceCheckUtils]: 55: Hoare triple {18011#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {18015#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,598 INFO L273 TraceCheckUtils]: 56: Hoare triple {18015#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18019#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:39:26,599 INFO L273 TraceCheckUtils]: 57: Hoare triple {18019#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {18023#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,600 INFO L273 TraceCheckUtils]: 58: Hoare triple {18023#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18027#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:39:26,601 INFO L273 TraceCheckUtils]: 59: Hoare triple {18027#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {18031#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,602 INFO L273 TraceCheckUtils]: 60: Hoare triple {18031#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18035#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:39:26,603 INFO L273 TraceCheckUtils]: 61: Hoare triple {18035#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {18039#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,604 INFO L273 TraceCheckUtils]: 62: Hoare triple {18039#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18043#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:39:26,606 INFO L273 TraceCheckUtils]: 63: Hoare triple {18043#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {18047#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,607 INFO L273 TraceCheckUtils]: 64: Hoare triple {18047#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18051#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:39:26,608 INFO L273 TraceCheckUtils]: 65: Hoare triple {18051#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {18055#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,609 INFO L273 TraceCheckUtils]: 66: Hoare triple {18055#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18059#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:39:26,610 INFO L273 TraceCheckUtils]: 67: Hoare triple {18059#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {18063#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,611 INFO L273 TraceCheckUtils]: 68: Hoare triple {18063#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18067#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:39:26,612 INFO L273 TraceCheckUtils]: 69: Hoare triple {18067#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {18071#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:39:26,614 INFO L273 TraceCheckUtils]: 70: Hoare triple {18071#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {18075#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:39:26,615 INFO L273 TraceCheckUtils]: 71: Hoare triple {18075#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {18079#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:39:26,616 INFO L273 TraceCheckUtils]: 72: Hoare triple {18079#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {18083#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:39:26,617 INFO L273 TraceCheckUtils]: 73: Hoare triple {18083#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {18087#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:39:26,618 INFO L273 TraceCheckUtils]: 74: Hoare triple {18087#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {18091#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:39:26,619 INFO L273 TraceCheckUtils]: 75: Hoare triple {18091#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {18095#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,620 INFO L273 TraceCheckUtils]: 76: Hoare triple {18095#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18099#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:39:26,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {18099#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {18103#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:39:26,623 INFO L273 TraceCheckUtils]: 78: Hoare triple {18103#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {18107#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:39:26,624 INFO L273 TraceCheckUtils]: 79: Hoare triple {18107#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {18111#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,625 INFO L273 TraceCheckUtils]: 80: Hoare triple {18111#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18115#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} is VALID [2019-05-15 10:39:26,626 INFO L273 TraceCheckUtils]: 81: Hoare triple {18115#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} a := a[y := a[y] - 1]; {18119#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,627 INFO L273 TraceCheckUtils]: 82: Hoare triple {18119#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18123#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} is VALID [2019-05-15 10:39:26,628 INFO L273 TraceCheckUtils]: 83: Hoare triple {18123#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} a := a[y := a[y] - 1]; {18127#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,630 INFO L273 TraceCheckUtils]: 84: Hoare triple {18127#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18131#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} is VALID [2019-05-15 10:39:26,631 INFO L273 TraceCheckUtils]: 85: Hoare triple {18131#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} a := a[y := a[y] - 1]; {18135#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,632 INFO L273 TraceCheckUtils]: 86: Hoare triple {18135#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18139#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} is VALID [2019-05-15 10:39:26,633 INFO L273 TraceCheckUtils]: 87: Hoare triple {18139#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} a := a[y := a[y] - 1]; {18143#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,634 INFO L273 TraceCheckUtils]: 88: Hoare triple {18143#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18147#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 44) (= (select main_a main_y) 957)))} is VALID [2019-05-15 10:39:26,635 INFO L273 TraceCheckUtils]: 89: Hoare triple {18147#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 44) (= (select main_a main_y) 957)))} a := a[y := a[y] - 1]; {18151#(or (and (= (select main_a main_y) 956) (= (select main_a main_x) 44)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,636 INFO L273 TraceCheckUtils]: 90: Hoare triple {18151#(or (and (= (select main_a main_y) 956) (= (select main_a main_x) 44)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18155#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 956) (= (select main_a main_x) 45)))} is VALID [2019-05-15 10:39:26,638 INFO L273 TraceCheckUtils]: 91: Hoare triple {18155#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 956) (= (select main_a main_x) 45)))} a := a[y := a[y] - 1]; {18159#(or (and (= (select main_a main_y) 955) (= (select main_a main_x) 45)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:39:26,638 INFO L273 TraceCheckUtils]: 92: Hoare triple {18159#(or (and (= (select main_a main_y) 955) (= (select main_a main_x) 45)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {17791#false} is VALID [2019-05-15 10:39:26,638 INFO L273 TraceCheckUtils]: 93: Hoare triple {17791#false} assume !(a[y] <= 0); {17791#false} is VALID [2019-05-15 10:39:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:39:26,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:39:26,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-15 10:39:26,680 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-05-15 10:39:26,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:39:26,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states. [2019-05-15 10:39:26,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:26,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-05-15 10:39:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-15 10:39:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2019-05-15 10:39:26,804 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-05-15 10:39:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:48,868 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-05-15 10:39:48,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-15 10:39:48,868 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-05-15 10:39:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:39:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-05-15 10:39:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2019-05-15 10:39:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-05-15 10:39:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2019-05-15 10:39:48,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 98 transitions. [2019-05-15 10:39:48,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:48,995 INFO L225 Difference]: With dead ends: 97 [2019-05-15 10:39:48,996 INFO L226 Difference]: Without dead ends: 97 [2019-05-15 10:39:48,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2019-05-15 10:39:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-05-15 10:39:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-05-15 10:39:48,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:39:48,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2019-05-15 10:39:48,997 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2019-05-15 10:39:48,998 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2019-05-15 10:39:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:48,998 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-05-15 10:39:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-05-15 10:39:48,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:48,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:48,999 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2019-05-15 10:39:48,999 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2019-05-15 10:39:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:49,000 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-05-15 10:39:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-05-15 10:39:49,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:49,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:49,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:39:49,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:39:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-05-15 10:39:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-05-15 10:39:49,001 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-05-15 10:39:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:39:49,002 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-05-15 10:39:49,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-05-15 10:39:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-05-15 10:39:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-05-15 10:39:49,002 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:39:49,002 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-05-15 10:39:49,002 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:39:49,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:39:49,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1331924943, now seen corresponding path program 46 times [2019-05-15 10:39:49,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:39:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:49,127 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-15 10:39:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:49,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:39:49,179 INFO L375 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 6 treesize of output 5 [2019-05-15 10:39:49,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:39:49,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2175]. (= (store v_main_a_2175 main_x 0) main_a) [2019-05-15 10:39:49,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:39:49,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:39:49,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,217 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:39:49,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:39:49,220 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2176]. (and (= (store v_main_a_2176 main_y 1000) main_a) (= (select v_main_a_2176 main_x) 0)) [2019-05-15 10:39:49,221 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:39:49,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:49,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:49,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:49,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,263 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:49,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,288 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:49,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:49,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:49,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2177]. (let ((.cse2 (select v_main_a_2177 main_x))) (let ((.cse0 (= (store v_main_a_2177 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_2177 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and (= .cse2 0) .cse0 .cse1)))) [2019-05-15 10:39:49,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:39:49,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:49,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:49,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:49,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,376 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:49,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:49,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:49,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2178]. (let ((.cse2 (select v_main_a_2178 main_y))) (let ((.cse1 (= (store v_main_a_2178 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2178 main_x))) (or (and (= .cse0 1) .cse1 (= .cse2 1000)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:39:49,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:49,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:49,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:49,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:49,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,508 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:49,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:49,508 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:49,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2179]. (let ((.cse0 (select v_main_a_2179 main_x))) (let ((.cse1 (= (store v_main_a_2179 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and .cse1 (= 1 .cse0) (= 999 (select v_main_a_2179 main_y)))))) [2019-05-15 10:39:49,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:39:49,554 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:49,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:49,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:49,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:49,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,611 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:49,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:49,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:49,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2180]. (let ((.cse2 (select v_main_a_2180 main_y))) (let ((.cse1 (select v_main_a_2180 main_x)) (.cse0 (= main_a (store v_main_a_2180 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 2) .cse0 (= .cse2 999))))) [2019-05-15 10:39:49,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:49,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:49,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:49,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:49,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,740 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:49,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:49,741 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:49,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2181]. (let ((.cse1 (select v_main_a_2181 main_x))) (let ((.cse0 (= (store v_main_a_2181 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 2) (= 998 (select v_main_a_2181 main_y)) .cse0)))) [2019-05-15 10:39:49,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:39:49,788 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:49,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:49,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:49,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:49,811 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,834 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:49,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:49,835 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:49,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2182]. (let ((.cse2 (select v_main_a_2182 main_y))) (let ((.cse1 (select v_main_a_2182 main_x)) (.cse0 (= (store v_main_a_2182 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 998 .cse2) (= 3 .cse1) .cse0)))) [2019-05-15 10:39:49,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:49,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:49,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:49,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:49,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,943 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:49,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:49,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:49,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2183]. (let ((.cse1 (select v_main_a_2183 main_x))) (let ((.cse0 (= main_a (store v_main_a_2183 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 3 .cse1) .cse0 (= 997 (select v_main_a_2183 main_y)))))) [2019-05-15 10:39:49,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:39:49,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:49,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:49,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:49,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,017 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,041 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:50,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2184]. (let ((.cse2 (select v_main_a_2184 main_y))) (let ((.cse1 (select v_main_a_2184 main_x)) (.cse0 (= (store v_main_a_2184 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 997 .cse2) (= 4 .cse1) .cse0)))) [2019-05-15 10:39:50,080 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:50,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:50,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:50,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,179 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:50,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2185]. (let ((.cse0 (select v_main_a_2185 main_x))) (let ((.cse1 (= (store v_main_a_2185 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 4) .cse1 (= (select v_main_a_2185 main_y) 996)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:39:50,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:39:50,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:50,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:50,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,282 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:50,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2186]. (let ((.cse2 (select v_main_a_2186 main_y))) (let ((.cse0 (select v_main_a_2186 main_x)) (.cse1 (= main_a (store v_main_a_2186 main_y (+ .cse2 (- 1)))))) (or (and (= .cse0 5) .cse1 (= .cse2 996)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:39:50,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:50,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:50,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:50,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,405 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:50,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2187]. (let ((.cse1 (select v_main_a_2187 main_x))) (let ((.cse0 (= (store v_main_a_2187 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_2187 main_y) 995) .cse0 (= .cse1 5)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:50,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:39:50,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:50,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:50,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:50,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,505 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,507 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,542 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,542 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:50,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,574 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2188]. (let ((.cse2 (select v_main_a_2188 main_y))) (let ((.cse0 (= (store v_main_a_2188 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2188 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 6) (= .cse2 995))))) [2019-05-15 10:39:50,574 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:50,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:50,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:50,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,639 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,663 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:50,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2189]. (let ((.cse1 (select v_main_a_2189 main_x))) (let ((.cse0 (= main_a (store v_main_a_2189 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 6) .cse0 (= (select v_main_a_2189 main_y) 994))))) [2019-05-15 10:39:50,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:39:50,724 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:50,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:50,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:50,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,773 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:50,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2190]. (let ((.cse2 (select v_main_a_2190 main_y))) (let ((.cse0 (select v_main_a_2190 main_x)) (.cse1 (= (store v_main_a_2190 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 7) (= .cse2 994) .cse1)))) [2019-05-15 10:39:50,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:39:50,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:50,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:50,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,888 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:50,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2191]. (let ((.cse0 (select v_main_a_2191 main_x))) (let ((.cse1 (= (store v_main_a_2191 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2191 main_y) 993) .cse1 (= .cse0 7))))) [2019-05-15 10:39:50,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:39:50,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:50,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:50,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:50,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:50,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,995 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:50,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:50,995 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2192]. (let ((.cse2 (select v_main_a_2192 main_y))) (let ((.cse0 (= (store v_main_a_2192 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2192 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 993) (= .cse1 8))))) [2019-05-15 10:39:51,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:39:51,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:51,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:51,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:51,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,110 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:51,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:51,110 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2193]. (let ((.cse1 (select v_main_a_2193 main_x))) (let ((.cse0 (= (store v_main_a_2193 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 8) (= (select v_main_a_2193 main_y) 992) .cse0)))) [2019-05-15 10:39:51,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:39:51,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:51,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:51,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:51,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:51,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,215 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:51,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:51,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2194]. (let ((.cse2 (select v_main_a_2194 main_y))) (let ((.cse1 (select v_main_a_2194 main_x)) (.cse0 (= (store v_main_a_2194 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 9) (= .cse2 992) .cse0)))) [2019-05-15 10:39:51,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:39:51,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:51,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:51,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:51,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,332 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:51,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:51,333 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2195]. (let ((.cse0 (select v_main_a_2195 main_x))) (let ((.cse1 (= main_a (store v_main_a_2195 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2195 main_y) 991) (= .cse0 9) .cse1)))) [2019-05-15 10:39:51,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:39:51,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:51,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:51,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:51,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:51,417 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,441 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:51,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:51,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2196]. (let ((.cse2 (select v_main_a_2196 main_y))) (let ((.cse0 (select v_main_a_2196 main_x)) (.cse1 (= main_a (store v_main_a_2196 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 991) (= .cse0 10) .cse1)))) [2019-05-15 10:39:51,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:51,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:51,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:51,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:51,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,569 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:51,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:51,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2197]. (let ((.cse1 (select v_main_a_2197 main_x))) (let ((.cse0 (= (store v_main_a_2197 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 10) (= 990 (select v_main_a_2197 main_y)) .cse0)))) [2019-05-15 10:39:51,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:39:51,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:51,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:51,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:51,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:51,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,689 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:51,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:51,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,703 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2198]. (let ((.cse2 (select v_main_a_2198 main_y))) (let ((.cse1 (= (store v_main_a_2198 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2198 main_x))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and .cse1 (= 11 .cse0) (= 990 .cse2))))) [2019-05-15 10:39:51,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:39:51,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:51,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:51,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:51,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,807 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:51,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:51,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2199]. (let ((.cse1 (select v_main_a_2199 main_x))) (let ((.cse0 (= (store v_main_a_2199 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 11) (= (select v_main_a_2199 main_y) 989)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:51,821 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:39:51,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:51,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:51,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:51,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,924 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:51,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:51,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:51,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,948 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2200]. (let ((.cse0 (select v_main_a_2200 main_y))) (let ((.cse1 (select v_main_a_2200 main_x)) (.cse2 (= (store v_main_a_2200 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 989 .cse0) (= 12 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:39:51,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:52,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:52,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:52,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:52,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,066 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:52,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:52,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:52,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2201]. (let ((.cse1 (select v_main_a_2201 main_x))) (let ((.cse0 (= (store v_main_a_2201 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_2201 main_y) 988) (= .cse1 12)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:52,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:39:52,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:52,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:52,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:52,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,195 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:52,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:52,196 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:52,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2202]. (let ((.cse2 (select v_main_a_2202 main_y))) (let ((.cse0 (= (store v_main_a_2202 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2202 main_x))) (or (and .cse0 (= .cse1 13) (= .cse2 988)) (and (= main_y main_x) .cse0 (= .cse1 1001))))) [2019-05-15 10:39:52,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:52,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:52,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:52,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:52,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,345 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:52,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:52,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:52,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2203]. (let ((.cse0 (select v_main_a_2203 main_x))) (let ((.cse1 (= (store v_main_a_2203 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 13) (= (select v_main_a_2203 main_y) 987) .cse1)))) [2019-05-15 10:39:52,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:39:52,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:52,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:52,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:52,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:52,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,479 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:52,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:52,479 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:52,490 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2204]. (let ((.cse2 (select v_main_a_2204 main_y))) (let ((.cse0 (= (store v_main_a_2204 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2204 main_x))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and .cse0 (= 14 .cse1) (= .cse2 987))))) [2019-05-15 10:39:52,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:39:52,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:52,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:52,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:52,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,598 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:52,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:52,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:52,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2205]. (let ((.cse1 (select v_main_a_2205 main_x))) (let ((.cse0 (= main_a (store v_main_a_2205 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= 14 .cse1) .cse0 (= (select v_main_a_2205 main_y) 986))))) [2019-05-15 10:39:52,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:39:52,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:52,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:52,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:52,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,698 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:52,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,723 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:52,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:52,723 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:52,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2206]. (let ((.cse2 (select v_main_a_2206 main_y))) (let ((.cse0 (= main_a (store v_main_a_2206 main_y (+ .cse2 (- 1))))) (.cse1 (select v_main_a_2206 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 15) (= 986 .cse2))))) [2019-05-15 10:39:52,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:52,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:52,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:52,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:52,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,896 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:52,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:52,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:52,908 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,908 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2207]. (let ((.cse1 (select v_main_a_2207 main_x))) (let ((.cse0 (= main_a (store v_main_a_2207 main_x (+ .cse1 1))))) (or (and (= (select v_main_a_2207 main_y) 985) .cse0 (= .cse1 15)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:39:52,908 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:39:52,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:52,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:52,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:53,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,036 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:53,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:53,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:53,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2208]. (let ((.cse0 (select v_main_a_2208 main_y))) (let ((.cse1 (= (store v_main_a_2208 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_2208 main_x))) (or (and (= .cse0 985) .cse1 (= .cse2 16)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:39:53,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:53,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:53,170 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:53,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:53,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,201 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:53,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:53,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:53,213 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,214 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2209]. (let ((.cse1 (select v_main_a_2209 main_x))) (let ((.cse0 (= (store v_main_a_2209 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 16) (= (select v_main_a_2209 main_y) 984)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:53,214 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:39:53,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:53,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:53,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:53,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:53,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,326 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:53,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:53,327 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:53,335 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2210]. (let ((.cse2 (select v_main_a_2210 main_y))) (let ((.cse0 (= (store v_main_a_2210 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2210 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 984) (= .cse1 17))))) [2019-05-15 10:39:53,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:39:53,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:53,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:53,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:53,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,451 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:53,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:53,452 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:53,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2211]. (let ((.cse1 (select v_main_a_2211 main_x))) (let ((.cse0 (= (store v_main_a_2211 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_2211 main_y) 983) (= .cse1 17))))) [2019-05-15 10:39:53,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:39:53,537 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:53,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:53,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:53,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:53,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,597 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:53,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:53,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:53,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2212]. (let ((.cse2 (select v_main_a_2212 main_y))) (let ((.cse0 (= (store v_main_a_2212 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2212 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 983) (= .cse1 18))))) [2019-05-15 10:39:53,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:53,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:53,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:53,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:53,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,763 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:53,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:53,763 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:53,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2213]. (let ((.cse0 (select v_main_a_2213 main_x))) (let ((.cse1 (= main_a (store v_main_a_2213 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 18) (= (select v_main_a_2213 main_y) 982) .cse1)))) [2019-05-15 10:39:53,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:39:53,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:53,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:53,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:53,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:53,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,894 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:53,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:53,895 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:53,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2214]. (let ((.cse2 (select v_main_a_2214 main_y))) (let ((.cse0 (= (store v_main_a_2214 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2214 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 19) (= .cse2 982))))) [2019-05-15 10:39:53,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:39:53,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:53,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:53,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:54,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,028 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:54,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:54,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:54,041 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2215]. (let ((.cse1 (select v_main_a_2215 main_x))) (let ((.cse0 (= (store v_main_a_2215 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 19 .cse1) (= 981 (select v_main_a_2215 main_y))) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:39:54,042 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:39:54,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:54,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:54,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:54,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,178 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:54,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:54,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:54,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2216]. (let ((.cse0 (select v_main_a_2216 main_y))) (let ((.cse1 (select v_main_a_2216 main_x)) (.cse2 (= (store v_main_a_2216 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 981) (= .cse1 20) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:39:54,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:54,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:54,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:54,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:54,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,352 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:54,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:54,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:54,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2217]. (let ((.cse0 (select v_main_a_2217 main_x))) (let ((.cse1 (= (store v_main_a_2217 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2217 main_y) 980) (= .cse0 20) .cse1)))) [2019-05-15 10:39:54,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:39:54,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:54,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:54,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:54,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,495 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:54,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:54,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:54,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2218]. (let ((.cse2 (select v_main_a_2218 main_y))) (let ((.cse0 (select v_main_a_2218 main_x)) (.cse1 (= main_a (store v_main_a_2218 main_y (+ .cse2 (- 1)))))) (or (and (= .cse0 21) .cse1 (= .cse2 980)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:39:54,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:54,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:54,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:54,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:54,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,726 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:54,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:54,726 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:54,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,743 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2219]. (let ((.cse1 (select v_main_a_2219 main_x))) (let ((.cse0 (= (store v_main_a_2219 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= (select v_main_a_2219 main_y) 979) .cse0 (= .cse1 21))))) [2019-05-15 10:39:54,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:39:54,824 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:54,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:54,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:54,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:54,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,883 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:54,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:54,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:54,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2220]. (let ((.cse2 (select v_main_a_2220 main_y))) (let ((.cse0 (select v_main_a_2220 main_x)) (.cse1 (= (store v_main_a_2220 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 22 .cse0) (= 979 .cse2) .cse1)))) [2019-05-15 10:39:54,893 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:39:54,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:54,995 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:54,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:55,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,029 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:55,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:55,029 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:55,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2221]. (let ((.cse0 (select v_main_a_2221 main_x))) (let ((.cse1 (= (store v_main_a_2221 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 22) (= (select v_main_a_2221 main_y) 978) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:55,042 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:39:55,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:55,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:55,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:55,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,159 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:55,161 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,196 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:55,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:55,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:55,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2222]. (let ((.cse2 (select v_main_a_2222 main_y))) (let ((.cse0 (select v_main_a_2222 main_x)) (.cse1 (= (store v_main_a_2222 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 23) .cse1 (= .cse2 978))))) [2019-05-15 10:39:55,236 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:55,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:55,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:55,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:55,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,365 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:55,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:55,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:55,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2223]. (let ((.cse0 (select v_main_a_2223 main_x))) (let ((.cse1 (= (store v_main_a_2223 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 23) .cse1 (= 977 (select v_main_a_2223 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:55,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:39:55,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:55,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:55,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:55,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,509 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:55,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:55,510 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:55,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2224]. (let ((.cse0 (select v_main_a_2224 main_y))) (let ((.cse2 (= (store v_main_a_2224 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_2224 main_x))) (or (and (= .cse0 977) (= .cse1 24) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:39:55,569 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:55,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:55,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:55,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:55,675 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,709 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:55,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:55,710 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:55,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2225]. (let ((.cse1 (select v_main_a_2225 main_x))) (let ((.cse0 (= (store v_main_a_2225 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 24) (= (select v_main_a_2225 main_y) 976) .cse0)))) [2019-05-15 10:39:55,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:39:55,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:55,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:55,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:55,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,834 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:55,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,863 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:55,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:55,864 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:55,908 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,908 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2226]. (let ((.cse2 (select v_main_a_2226 main_y))) (let ((.cse1 (select v_main_a_2226 main_x)) (.cse0 (= (store v_main_a_2226 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 25) .cse0 (= .cse2 976))))) [2019-05-15 10:39:55,908 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:55,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:56,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:56,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:56,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,049 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:56,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:56,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:56,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2227]. (let ((.cse0 (select v_main_a_2227 main_x))) (let ((.cse1 (= (store v_main_a_2227 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_2227 main_y) 975) (= .cse0 25) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:39:56,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:39:56,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:56,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:56,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:56,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:56,170 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,207 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:56,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:56,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:56,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2228]. (let ((.cse2 (select v_main_a_2228 main_y))) (let ((.cse1 (select v_main_a_2228 main_x)) (.cse0 (= (store v_main_a_2228 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 26) .cse0 (= .cse2 975))))) [2019-05-15 10:39:56,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:56,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:56,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:56,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:56,397 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,422 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:56,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:56,423 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:56,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2229]. (let ((.cse0 (select v_main_a_2229 main_x))) (let ((.cse1 (= (store v_main_a_2229 main_x (+ .cse0 1)) main_a))) (or (and (= (select v_main_a_2229 main_y) 974) (= .cse0 26) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:39:56,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:39:56,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:56,546 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:56,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:56,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,580 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:56,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:56,580 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:56,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2230]. (let ((.cse0 (select v_main_a_2230 main_y))) (let ((.cse1 (= (store v_main_a_2230 main_y (+ .cse0 (- 1))) main_a)) (.cse2 (select v_main_a_2230 main_x))) (or (and (= .cse0 974) .cse1 (= .cse2 27)) (and (= main_y main_x) .cse1 (= .cse2 1001))))) [2019-05-15 10:39:56,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:56,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:56,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:56,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:56,753 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,779 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:56,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:56,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:56,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,793 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2231]. (let ((.cse0 (select v_main_a_2231 main_x))) (let ((.cse1 (= (store v_main_a_2231 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 27 .cse0) .cse1 (= (select v_main_a_2231 main_y) 973))))) [2019-05-15 10:39:56,793 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:39:56,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:56,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:56,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:56,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:56,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,934 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:56,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:56,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:56,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2232]. (let ((.cse2 (select v_main_a_2232 main_y))) (let ((.cse0 (= (store v_main_a_2232 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2232 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 28) (= .cse2 973))))) [2019-05-15 10:39:56,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:57,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:57,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:57,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:57,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,121 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:57,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:57,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:57,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2233]. (let ((.cse0 (select v_main_a_2233 main_x))) (let ((.cse1 (= (store v_main_a_2233 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 28) .cse1 (= (select v_main_a_2233 main_y) 972)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:39:57,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:39:57,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:57,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:57,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:57,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:57,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,280 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:57,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:57,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:57,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2234]. (let ((.cse2 (select v_main_a_2234 main_y))) (let ((.cse0 (= (store v_main_a_2234 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2234 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 972) (= .cse1 29))))) [2019-05-15 10:39:57,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:57,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:57,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:57,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:57,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,513 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:57,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:57,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:57,525 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,525 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2235]. (let ((.cse1 (select v_main_a_2235 main_x))) (let ((.cse0 (= (store v_main_a_2235 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 29 .cse1) (= 971 (select v_main_a_2235 main_y)))))) [2019-05-15 10:39:57,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:39:57,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:57,635 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:57,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:57,643 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,679 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:57,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:57,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:57,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2236]. (let ((.cse1 (select v_main_a_2236 main_y))) (let ((.cse0 (= main_a (store v_main_a_2236 main_y (+ .cse1 (- 1))))) (.cse2 (select v_main_a_2236 main_x))) (or (and .cse0 (= 971 .cse1) (= .cse2 30)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:39:57,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:57,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:57,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:57,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:57,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,890 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:57,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:57,891 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:57,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2237]. (let ((.cse1 (select v_main_a_2237 main_x))) (let ((.cse0 (= (store v_main_a_2237 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 30) (= 970 (select v_main_a_2237 main_y))) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:39:57,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:39:57,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:58,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:58,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:58,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,053 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:58,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:58,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:58,109 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2238]. (let ((.cse2 (select v_main_a_2238 main_y))) (let ((.cse0 (= (store v_main_a_2238 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2238 main_x))) (or (and .cse0 (= 31 .cse1) (= 970 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:39:58,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:58,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:58,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:58,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:58,233 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,269 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:58,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:58,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:58,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2239]. (let ((.cse1 (select v_main_a_2239 main_x))) (let ((.cse0 (= (store v_main_a_2239 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_2239 main_y) 969) .cse0 (= 31 .cse1))))) [2019-05-15 10:39:58,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:39:58,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:58,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:58,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:58,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,443 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:58,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:58,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:58,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2240]. (let ((.cse2 (select v_main_a_2240 main_y))) (let ((.cse1 (= main_a (store v_main_a_2240 main_y (+ .cse2 (- 1))))) (.cse0 (select v_main_a_2240 main_x))) (or (and (= .cse0 32) .cse1 (= .cse2 969)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:39:58,498 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:58,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:58,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:58,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:58,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,661 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:58,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:58,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:58,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2241]. (let ((.cse1 (select v_main_a_2241 main_x))) (let ((.cse0 (= main_a (store v_main_a_2241 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 32) (= (select v_main_a_2241 main_y) 968))))) [2019-05-15 10:39:58,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:39:58,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:58,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:58,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:58,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,828 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:58,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:58,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:58,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2242]. (let ((.cse1 (select v_main_a_2242 main_y))) (let ((.cse0 (select v_main_a_2242 main_x)) (.cse2 (= (store v_main_a_2242 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 33) (= .cse1 968) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:39:58,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:58,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:58,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:58,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:59,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,035 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:59,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:59,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:59,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:59,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2243]. (let ((.cse0 (select v_main_a_2243 main_x))) (let ((.cse1 (= (store v_main_a_2243 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2243 main_y) 967) (= .cse0 33) .cse1)))) [2019-05-15 10:39:59,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:39:59,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:39:59,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:59,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:59,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:59,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:59,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,211 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:59,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:59,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:59,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:59,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2244]. (let ((.cse2 (select v_main_a_2244 main_y))) (let ((.cse0 (= (store v_main_a_2244 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2244 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 967) (= .cse1 34))))) [2019-05-15 10:39:59,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:39:59,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:59,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:59,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:59,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:39:59,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,470 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:59,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:59,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:59,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:59,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2245]. (let ((.cse0 (select v_main_a_2245 main_x))) (let ((.cse1 (= (store v_main_a_2245 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 34) .cse1 (= 966 (select v_main_a_2245 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:39:59,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:39:59,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:59,614 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:59,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:59,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:59,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,644 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:59,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:59,644 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:59,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:59,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2246]. (let ((.cse1 (select v_main_a_2246 main_y))) (let ((.cse2 (= (store v_main_a_2246 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_2246 main_x))) (or (and (= .cse0 35) (= .cse1 966) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:39:59,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:39:59,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:59,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:59,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,789 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:59,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:59,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,815 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:59,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:59,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:59,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:59,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2247]. (let ((.cse1 (select v_main_a_2247 main_x))) (let ((.cse0 (= (store v_main_a_2247 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= (select v_main_a_2247 main_y) 965) (= 35 .cse1))))) [2019-05-15 10:39:59,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:39:59,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:39:59,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:59,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:39:59,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:39:59,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:59,981 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:39:59,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:39:59,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:39:59,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:59,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2248]. (let ((.cse1 (select v_main_a_2248 main_y))) (let ((.cse2 (select v_main_a_2248 main_x)) (.cse0 (= (store v_main_a_2248 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= 965 .cse1) (= .cse2 36)) (and (= main_y main_x) (= .cse2 1001) .cse0)))) [2019-05-15 10:39:59,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:40:00,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:00,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:00,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:00,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:00,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,151 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:00,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:00,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:00,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:00,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2249]. (let ((.cse1 (select v_main_a_2249 main_x))) (let ((.cse0 (= (store v_main_a_2249 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 36) .cse0 (= (select v_main_a_2249 main_y) 964))))) [2019-05-15 10:40:00,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:40:00,270 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:00,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:00,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:00,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,291 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:00,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:00,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,317 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:00,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:00,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:00,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:00,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2250]. (let ((.cse2 (select v_main_a_2250 main_y))) (let ((.cse0 (select v_main_a_2250 main_x)) (.cse1 (= (store v_main_a_2250 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 37) .cse1 (= 964 .cse2))))) [2019-05-15 10:40:00,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:00,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:00,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:00,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,506 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:00,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:00,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,543 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:00,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:00,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:00,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:00,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2251]. (let ((.cse0 (select v_main_a_2251 main_x))) (let ((.cse1 (= main_a (store v_main_a_2251 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2251 main_y) 963) .cse1 (= .cse0 37))))) [2019-05-15 10:40:00,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:40:00,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:00,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:00,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:00,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:00,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:00,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,718 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:00,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:00,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:00,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:00,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2252]. (let ((.cse2 (select v_main_a_2252 main_y))) (let ((.cse1 (select v_main_a_2252 main_x)) (.cse0 (= main_a (store v_main_a_2252 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 38) (= .cse2 963) .cse0)))) [2019-05-15 10:40:00,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:40:00,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:00,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:00,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:00,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:00,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:00,899 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:00,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:00,900 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:00,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:00,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2253]. (let ((.cse1 (select v_main_a_2253 main_x))) (let ((.cse0 (= main_a (store v_main_a_2253 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 38 .cse1) (= 962 (select v_main_a_2253 main_y)))))) [2019-05-15 10:40:00,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:40:01,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:01,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:01,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:01,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:01,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:01,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,075 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:01,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:01,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:01,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:01,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2254]. (let ((.cse2 (select v_main_a_2254 main_y))) (let ((.cse0 (= (store v_main_a_2254 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2254 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 39) (= .cse2 962))))) [2019-05-15 10:40:01,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:01,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:01,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:01,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:01,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:01,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,300 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:01,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:01,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:01,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:01,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2255]. (let ((.cse0 (select v_main_a_2255 main_x))) (let ((.cse1 (= (store v_main_a_2255 main_x (+ .cse0 1)) main_a))) (or (and (= 39 .cse0) (= 961 (select v_main_a_2255 main_y)) .cse1) (and (= main_y main_x) (= 1000 .cse0) .cse1)))) [2019-05-15 10:40:01,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 961) (= .cse0 40)))) [2019-05-15 10:40:01,430 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:01,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:01,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:01,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:01,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:01,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,478 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:01,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:01,479 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:01,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:01,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2256]. (let ((.cse2 (select v_main_a_2256 main_y))) (let ((.cse0 (select v_main_a_2256 main_x)) (.cse1 (= (store v_main_a_2256 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 40) (= .cse2 961) .cse1)))) [2019-05-15 10:40:01,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:01,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:01,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:01,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:01,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:01,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,722 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:01,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:01,723 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:01,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:01,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2257]. (let ((.cse1 (select v_main_a_2257 main_x))) (let ((.cse0 (= (store v_main_a_2257 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 40) (= (select v_main_a_2257 main_y) 960))))) [2019-05-15 10:40:01,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 41) (= (select main_a main_y) 960)))) [2019-05-15 10:40:01,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:01,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:01,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:01,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:01,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:01,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:01,913 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:01,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:01,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:01,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:01,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2258]. (let ((.cse2 (select v_main_a_2258 main_y))) (let ((.cse1 (select v_main_a_2258 main_x)) (.cse0 (= (store v_main_a_2258 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= 41 .cse1) (= 960 .cse2) .cse0)))) [2019-05-15 10:40:01,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 959) (= .cse0 41)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:02,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:02,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:02,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:02,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:02,130 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,153 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:02,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:02,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:02,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:02,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2259]. (let ((.cse1 (select v_main_a_2259 main_x))) (let ((.cse0 (= main_a (store v_main_a_2259 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 41) (= (select v_main_a_2259 main_y) 959))))) [2019-05-15 10:40:02,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 959) (= .cse0 42)))) [2019-05-15 10:40:02,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:02,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:02,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:02,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:02,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,338 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:02,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:02,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:02,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:02,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2260]. (let ((.cse1 (select v_main_a_2260 main_y))) (let ((.cse0 (select v_main_a_2260 main_x)) (.cse2 (= (store v_main_a_2260 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 42) (= .cse1 959) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:40:02,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:02,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:02,515 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:02,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:02,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:02,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,556 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:02,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:02,556 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:02,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:02,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2261]. (let ((.cse1 (select v_main_a_2261 main_x))) (let ((.cse0 (= (store v_main_a_2261 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 42) (= (select v_main_a_2261 main_y) 958)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:40:02,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 43) (= (select main_a main_y) 958)))) [2019-05-15 10:40:02,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:02,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:02,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:02,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:02,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,735 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:02,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:02,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:02,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:02,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2262]. (let ((.cse1 (select v_main_a_2262 main_y))) (let ((.cse0 (select v_main_a_2262 main_x)) (.cse2 (= (store v_main_a_2262 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 43) (= .cse1 958) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:40:02,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:02,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:02,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:02,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:02,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:02,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:02,964 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:02,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:02,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:02,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:02,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2263]. (let ((.cse1 (select v_main_a_2263 main_x))) (let ((.cse0 (= (store v_main_a_2263 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 43) (= (select v_main_a_2263 main_y) 957))))) [2019-05-15 10:40:02,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 44) (= (select main_a main_y) 957)))) [2019-05-15 10:40:03,097 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:03,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:03,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:03,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:03,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:03,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:03,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:03,155 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:03,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:03,156 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:03,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:03,249 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2264]. (let ((.cse2 (select v_main_a_2264 main_y))) (let ((.cse1 (select v_main_a_2264 main_x)) (.cse0 (= (store v_main_a_2264 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 44) (= .cse2 957) .cse0)))) [2019-05-15 10:40:03,249 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 956) (= .cse0 44)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:03,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:03,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:03,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:03,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:03,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:03,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:03,420 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:03,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:03,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:03,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:03,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2265]. (let ((.cse1 (select v_main_a_2265 main_x))) (let ((.cse0 (= (store v_main_a_2265 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_2265 main_y) 956) (= .cse1 44))))) [2019-05-15 10:40:03,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 956) (= .cse0 45)))) [2019-05-15 10:40:03,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:03,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:03,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:03,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:03,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:03,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:03,619 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:03,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:03,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:03,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:03,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2266]. (let ((.cse1 (select v_main_a_2266 main_y))) (let ((.cse0 (= (store v_main_a_2266 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_2266 main_x))) (or (and .cse0 (= .cse1 956) (= .cse2 45)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:40:03,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 955) (= .cse0 45)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:03,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:03,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:03,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:03,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:03,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:03,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:03,873 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:03,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:03,873 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:03,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:03,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2267]. (let ((.cse0 (select v_main_a_2267 main_x))) (let ((.cse1 (= (store v_main_a_2267 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 955 (select v_main_a_2267 main_y)) (= 45 .cse0) .cse1)))) [2019-05-15 10:40:03,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 46) (= (select main_a main_y) 955)))) [2019-05-15 10:40:04,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:04,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:04,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:04,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:04,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:04,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:04,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:04,066 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:04,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:04,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:04,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:04,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2268]. (let ((.cse2 (select v_main_a_2268 main_y))) (let ((.cse0 (= (store v_main_a_2268 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2268 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse1 46) (= .cse2 955))))) [2019-05-15 10:40:04,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 46) (= (select main_a main_y) 954)))) [2019-05-15 10:40:04,201 INFO L273 TraceCheckUtils]: 0: Hoare triple {18553#true} a := a[x := 0]; {18558#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:40:04,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {18558#(= (select main_a main_x) 0)} a := a[y := 1000]; {18562#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:40:04,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {18562#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {18566#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:40:04,204 INFO L273 TraceCheckUtils]: 3: Hoare triple {18566#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {18570#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,205 INFO L273 TraceCheckUtils]: 4: Hoare triple {18570#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18574#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:40:04,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {18574#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {18578#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {18578#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18582#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:40:04,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {18582#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {18586#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {18586#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18590#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:40:04,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {18590#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {18594#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {18594#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18598#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:40:04,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {18598#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {18602#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {18602#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18606#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:40:04,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {18606#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {18610#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:40:04,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {18610#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {18614#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:40:04,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {18614#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {18618#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:40:04,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {18618#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {18622#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:40:04,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {18622#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {18626#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:40:04,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {18626#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {18630#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:40:04,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {18630#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {18634#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {18634#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18638#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:40:04,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {18638#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {18642#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {18642#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18646#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:40:04,227 INFO L273 TraceCheckUtils]: 23: Hoare triple {18646#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {18650#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:40:04,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {18650#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {18654#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:40:04,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {18654#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {18658#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {18658#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18662#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:40:04,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {18662#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {18666#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {18666#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18670#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:40:04,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {18670#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {18674#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:40:04,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {18674#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {18678#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:40:04,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {18678#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {18682#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,237 INFO L273 TraceCheckUtils]: 32: Hoare triple {18682#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18686#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:40:04,238 INFO L273 TraceCheckUtils]: 33: Hoare triple {18686#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {18690#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,239 INFO L273 TraceCheckUtils]: 34: Hoare triple {18690#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18694#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:40:04,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {18694#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {18698#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:40:04,242 INFO L273 TraceCheckUtils]: 36: Hoare triple {18698#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {18702#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:40:04,243 INFO L273 TraceCheckUtils]: 37: Hoare triple {18702#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {18706#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {18706#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18710#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:40:04,245 INFO L273 TraceCheckUtils]: 39: Hoare triple {18710#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {18714#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:40:04,246 INFO L273 TraceCheckUtils]: 40: Hoare triple {18714#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {18718#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:40:04,247 INFO L273 TraceCheckUtils]: 41: Hoare triple {18718#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {18722#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,248 INFO L273 TraceCheckUtils]: 42: Hoare triple {18722#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18726#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:40:04,249 INFO L273 TraceCheckUtils]: 43: Hoare triple {18726#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {18730#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,251 INFO L273 TraceCheckUtils]: 44: Hoare triple {18730#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18734#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:40:04,252 INFO L273 TraceCheckUtils]: 45: Hoare triple {18734#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {18738#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:40:04,253 INFO L273 TraceCheckUtils]: 46: Hoare triple {18738#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {18742#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:40:04,254 INFO L273 TraceCheckUtils]: 47: Hoare triple {18742#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {18746#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,255 INFO L273 TraceCheckUtils]: 48: Hoare triple {18746#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18750#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:40:04,256 INFO L273 TraceCheckUtils]: 49: Hoare triple {18750#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {18754#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,257 INFO L273 TraceCheckUtils]: 50: Hoare triple {18754#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18758#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:40:04,259 INFO L273 TraceCheckUtils]: 51: Hoare triple {18758#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {18762#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,260 INFO L273 TraceCheckUtils]: 52: Hoare triple {18762#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18766#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:40:04,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {18766#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {18770#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,262 INFO L273 TraceCheckUtils]: 54: Hoare triple {18770#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18774#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:40:04,263 INFO L273 TraceCheckUtils]: 55: Hoare triple {18774#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {18778#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,264 INFO L273 TraceCheckUtils]: 56: Hoare triple {18778#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18782#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:40:04,265 INFO L273 TraceCheckUtils]: 57: Hoare triple {18782#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {18786#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,266 INFO L273 TraceCheckUtils]: 58: Hoare triple {18786#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18790#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:40:04,267 INFO L273 TraceCheckUtils]: 59: Hoare triple {18790#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {18794#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {18794#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18798#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:40:04,270 INFO L273 TraceCheckUtils]: 61: Hoare triple {18798#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {18802#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,271 INFO L273 TraceCheckUtils]: 62: Hoare triple {18802#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18806#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:40:04,272 INFO L273 TraceCheckUtils]: 63: Hoare triple {18806#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {18810#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,273 INFO L273 TraceCheckUtils]: 64: Hoare triple {18810#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18814#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:40:04,274 INFO L273 TraceCheckUtils]: 65: Hoare triple {18814#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {18818#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {18818#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18822#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:40:04,277 INFO L273 TraceCheckUtils]: 67: Hoare triple {18822#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {18826#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {18826#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18830#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:40:04,279 INFO L273 TraceCheckUtils]: 69: Hoare triple {18830#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {18834#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:40:04,280 INFO L273 TraceCheckUtils]: 70: Hoare triple {18834#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {18838#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:40:04,281 INFO L273 TraceCheckUtils]: 71: Hoare triple {18838#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {18842#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:40:04,282 INFO L273 TraceCheckUtils]: 72: Hoare triple {18842#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {18846#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:40:04,283 INFO L273 TraceCheckUtils]: 73: Hoare triple {18846#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {18850#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:40:04,285 INFO L273 TraceCheckUtils]: 74: Hoare triple {18850#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {18854#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:40:04,295 INFO L273 TraceCheckUtils]: 75: Hoare triple {18854#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {18858#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,296 INFO L273 TraceCheckUtils]: 76: Hoare triple {18858#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18862#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:40:04,296 INFO L273 TraceCheckUtils]: 77: Hoare triple {18862#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {18866#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:40:04,297 INFO L273 TraceCheckUtils]: 78: Hoare triple {18866#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {18870#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:40:04,298 INFO L273 TraceCheckUtils]: 79: Hoare triple {18870#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {18874#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,299 INFO L273 TraceCheckUtils]: 80: Hoare triple {18874#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18878#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} is VALID [2019-05-15 10:40:04,300 INFO L273 TraceCheckUtils]: 81: Hoare triple {18878#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} a := a[y := a[y] - 1]; {18882#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,302 INFO L273 TraceCheckUtils]: 82: Hoare triple {18882#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18886#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} is VALID [2019-05-15 10:40:04,303 INFO L273 TraceCheckUtils]: 83: Hoare triple {18886#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} a := a[y := a[y] - 1]; {18890#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,304 INFO L273 TraceCheckUtils]: 84: Hoare triple {18890#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18894#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} is VALID [2019-05-15 10:40:04,305 INFO L273 TraceCheckUtils]: 85: Hoare triple {18894#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} a := a[y := a[y] - 1]; {18898#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,306 INFO L273 TraceCheckUtils]: 86: Hoare triple {18898#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18902#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} is VALID [2019-05-15 10:40:04,307 INFO L273 TraceCheckUtils]: 87: Hoare triple {18902#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} a := a[y := a[y] - 1]; {18906#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,308 INFO L273 TraceCheckUtils]: 88: Hoare triple {18906#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18910#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 44) (= (select main_a main_y) 957)))} is VALID [2019-05-15 10:40:04,310 INFO L273 TraceCheckUtils]: 89: Hoare triple {18910#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 44) (= (select main_a main_y) 957)))} a := a[y := a[y] - 1]; {18914#(or (and (= (select main_a main_y) 956) (= (select main_a main_x) 44)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,311 INFO L273 TraceCheckUtils]: 90: Hoare triple {18914#(or (and (= (select main_a main_y) 956) (= (select main_a main_x) 44)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18918#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 956) (= (select main_a main_x) 45)))} is VALID [2019-05-15 10:40:04,312 INFO L273 TraceCheckUtils]: 91: Hoare triple {18918#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 956) (= (select main_a main_x) 45)))} a := a[y := a[y] - 1]; {18922#(or (and (= (select main_a main_y) 955) (= (select main_a main_x) 45)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:04,313 INFO L273 TraceCheckUtils]: 92: Hoare triple {18922#(or (and (= (select main_a main_y) 955) (= (select main_a main_x) 45)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {18926#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 46) (= (select main_a main_y) 955)))} is VALID [2019-05-15 10:40:04,314 INFO L273 TraceCheckUtils]: 93: Hoare triple {18926#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 46) (= (select main_a main_y) 955)))} a := a[y := a[y] - 1]; {18930#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 46) (= (select main_a main_y) 954)))} is VALID [2019-05-15 10:40:04,315 INFO L273 TraceCheckUtils]: 94: Hoare triple {18930#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 46) (= (select main_a main_y) 954)))} assume x > y && a[x] == 1000; {18554#false} is VALID [2019-05-15 10:40:04,315 INFO L273 TraceCheckUtils]: 95: Hoare triple {18554#false} assume !(a[y] <= 0); {18554#false} is VALID [2019-05-15 10:40:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:40:04,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:40:04,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-15 10:40:04,350 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-05-15 10:40:04,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:40:04,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2019-05-15 10:40:04,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:04,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-05-15 10:40:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-15 10:40:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2019-05-15 10:40:04,476 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-05-15 10:40:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:27,325 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-05-15 10:40:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-15 10:40:27,326 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-05-15 10:40:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:40:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-05-15 10:40:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-05-15 10:40:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-05-15 10:40:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-05-15 10:40:27,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 100 transitions. [2019-05-15 10:40:27,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:27,454 INFO L225 Difference]: With dead ends: 99 [2019-05-15 10:40:27,454 INFO L226 Difference]: Without dead ends: 99 [2019-05-15 10:40:27,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2019-05-15 10:40:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-05-15 10:40:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-05-15 10:40:27,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:40:27,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 99 states. [2019-05-15 10:40:27,456 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2019-05-15 10:40:27,456 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2019-05-15 10:40:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:27,457 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-05-15 10:40:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-05-15 10:40:27,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:27,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:27,457 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2019-05-15 10:40:27,457 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2019-05-15 10:40:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:27,458 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-05-15 10:40:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-05-15 10:40:27,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:27,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:27,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:40:27,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:40:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-05-15 10:40:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-05-15 10:40:27,459 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-05-15 10:40:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:40:27,460 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-05-15 10:40:27,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-05-15 10:40:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-05-15 10:40:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-05-15 10:40:27,460 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:40:27,460 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-05-15 10:40:27,460 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:40:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:40:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash -79769454, now seen corresponding path program 47 times [2019-05-15 10:40:27,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:40:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:27,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-15 10:40:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:27,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:40:27,617 INFO L375 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 6 treesize of output 5 [2019-05-15 10:40:27,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:27,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:40:27,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:27,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2269]. (= (store v_main_a_2269 main_x 0) main_a) [2019-05-15 10:40:27,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select main_a main_x) 0) [2019-05-15 10:40:27,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:27,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-05-15 10:40:27,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,660 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-05-15 10:40:27,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:15 [2019-05-15 10:40:27,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:27,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2270]. (and (= (store v_main_a_2270 main_y 1000) main_a) (= (select v_main_a_2270 main_x) 0)) [2019-05-15 10:40:27,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000)) [2019-05-15 10:40:27,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:27,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:27,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:27,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:27,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:27,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,733 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:27,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:27,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:27,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:27,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2271]. (let ((.cse2 (select v_main_a_2271 main_x))) (let ((.cse0 (= (store v_main_a_2271 main_x (+ .cse2 1)) main_a)) (.cse1 (= (select v_main_a_2271 main_y) 1000))) (or (and (= main_y main_x) .cse0 .cse1) (and (= .cse2 0) .cse0 .cse1)))) [2019-05-15 10:40:27,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 1000) (= .cse0 1)))) [2019-05-15 10:40:27,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:27,791 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:27,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:27,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:27,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,821 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:27,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:27,821 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:27,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:27,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2272]. (let ((.cse2 (select v_main_a_2272 main_y))) (let ((.cse0 (= (store v_main_a_2272 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2272 main_x))) (or (and .cse0 (= .cse1 1) (= .cse2 1000)) (and .cse0 (= main_y main_x) (= .cse1 1001))))) [2019-05-15 10:40:27,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 999) (= .cse0 1)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:27,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:27,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:27,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:27,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:27,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:27,939 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:27,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:27,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:27,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:27,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2273]. (let ((.cse1 (select v_main_a_2273 main_x))) (let ((.cse0 (= (store v_main_a_2273 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= .cse1 1) (= (select v_main_a_2273 main_y) 999)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:40:27,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 2) (= (select main_a main_y) 999)))) [2019-05-15 10:40:27,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,043 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2274]. (let ((.cse0 (select v_main_a_2274 main_y))) (let ((.cse2 (select v_main_a_2274 main_x)) (.cse1 (= (store v_main_a_2274 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 999) .cse1 (= .cse2 2)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:40:28,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:28,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,155 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,156 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,168 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2275]. (let ((.cse1 (select v_main_a_2275 main_x))) (let ((.cse0 (= main_a (store v_main_a_2275 main_x (+ .cse1 1))))) (or (and .cse0 (= main_y main_x) (= 1000 .cse1)) (and .cse0 (= 2 .cse1) (= 998 (select v_main_a_2275 main_y)))))) [2019-05-15 10:40:28,168 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 3) (= (select main_a main_y) 998)))) [2019-05-15 10:40:28,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,251 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2276]. (let ((.cse2 (select v_main_a_2276 main_y))) (let ((.cse1 (select v_main_a_2276 main_x)) (.cse0 (= main_a (store v_main_a_2276 main_y (+ .cse2 (- 1)))))) (or (and .cse0 (= .cse1 3) (= .cse2 998)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:40:28,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 997) (= .cse0 3)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:28,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,354 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2277]. (let ((.cse1 (select v_main_a_2277 main_x))) (let ((.cse0 (= main_a (store v_main_a_2277 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_2277 main_y) 997) (= .cse1 3))))) [2019-05-15 10:40:28,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 997) (= .cse0 4)))) [2019-05-15 10:40:28,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,459 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2278]. (let ((.cse0 (select v_main_a_2278 main_y))) (let ((.cse2 (select v_main_a_2278 main_x)) (.cse1 (= main_a (store v_main_a_2278 main_y (+ .cse0 (- 1)))))) (or (and (= 997 .cse0) .cse1 (= 4 .cse2)) (and (= main_y main_x) (= 1001 .cse2) .cse1)))) [2019-05-15 10:40:28,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 4) (= (select main_a main_y) 996)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:28,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,546 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:28,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,588 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2279]. (let ((.cse0 (select v_main_a_2279 main_x))) (let ((.cse1 (= (store v_main_a_2279 main_x (+ .cse0 1)) main_a))) (or (and (= 996 (select v_main_a_2279 main_y)) (= 4 .cse0) .cse1) (and (= main_y main_x) .cse1 (= 1000 .cse0))))) [2019-05-15 10:40:28,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 5) (= (select main_a main_y) 996)))) [2019-05-15 10:40:28,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,653 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,683 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2280]. (let ((.cse0 (select v_main_a_2280 main_y))) (let ((.cse1 (select v_main_a_2280 main_x)) (.cse2 (= main_a (store v_main_a_2280 main_y (+ .cse0 (- 1)))))) (or (and (= 996 .cse0) (= .cse1 5) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:40:28,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:28,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,812 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,828 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2281]. (let ((.cse0 (select v_main_a_2281 main_x))) (let ((.cse1 (= main_a (store v_main_a_2281 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 5) .cse1 (= (select v_main_a_2281 main_y) 995))))) [2019-05-15 10:40:28,828 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 6) (= (select main_a main_y) 995)))) [2019-05-15 10:40:28,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:28,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,890 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:28,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:28,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:28,926 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:28,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:28,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:28,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:28,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2282]. (let ((.cse2 (select v_main_a_2282 main_y))) (let ((.cse1 (select v_main_a_2282 main_x)) (.cse0 (= (store v_main_a_2282 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 6) .cse0 (= .cse2 995))))) [2019-05-15 10:40:28,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 6) (= (select main_a main_y) 994)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:28,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:28,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:28,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,042 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2283]. (let ((.cse0 (select v_main_a_2283 main_x))) (let ((.cse1 (= (store v_main_a_2283 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= (select v_main_a_2283 main_y) 994) (= .cse0 6))))) [2019-05-15 10:40:29,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 994) (= .cse0 7)))) [2019-05-15 10:40:29,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:29,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:29,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,145 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2284]. (let ((.cse2 (select v_main_a_2284 main_y))) (let ((.cse1 (select v_main_a_2284 main_x)) (.cse0 (= (store v_main_a_2284 main_y (+ .cse2 (- 1))) main_a))) (or (and .cse0 (= .cse1 7) (= .cse2 994)) (and (= main_y main_x) (= .cse1 1001) .cse0)))) [2019-05-15 10:40:29,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 7) (= (select main_a main_y) 993)))) [2019-05-15 10:40:29,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:29,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:29,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,243 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,256 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2285]. (let ((.cse1 (select v_main_a_2285 main_x))) (let ((.cse0 (= (store v_main_a_2285 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and .cse0 (= 993 (select v_main_a_2285 main_y)) (= 7 .cse1))))) [2019-05-15 10:40:29,256 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 8) (= (select main_a main_y) 993)))) [2019-05-15 10:40:29,304 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:29,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:29,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:29,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,351 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2286]. (let ((.cse2 (select v_main_a_2286 main_y))) (let ((.cse0 (= (store v_main_a_2286 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2286 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 8) (= .cse2 993))))) [2019-05-15 10:40:29,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 8) (= (select main_a main_y) 992)))) [2019-05-15 10:40:29,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:29,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:29,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,431 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,456 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2287]. (let ((.cse1 (select v_main_a_2287 main_x))) (let ((.cse0 (= (store v_main_a_2287 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_2287 main_y) 992) .cse0 (= 8 .cse1))))) [2019-05-15 10:40:29,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 9) (= (select main_a main_y) 992)))) [2019-05-15 10:40:29,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:29,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:29,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,573 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,573 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2288]. (let ((.cse0 (select v_main_a_2288 main_y))) (let ((.cse1 (select v_main_a_2288 main_x)) (.cse2 (= (store v_main_a_2288 main_y (+ .cse0 (- 1))) main_a))) (or (and (= .cse0 992) (= 9 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:40:29,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 9) (= (select main_a main_y) 991)))) [2019-05-15 10:40:29,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:29,653 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:29,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,695 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2289]. (let ((.cse0 (select v_main_a_2289 main_x))) (let ((.cse1 (= (store v_main_a_2289 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 9) .cse1 (= (select v_main_a_2289 main_y) 991)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:40:29,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 991) (= .cse0 10)))) [2019-05-15 10:40:29,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:29,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:29,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:29,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,814 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2290]. (let ((.cse2 (select v_main_a_2290 main_y))) (let ((.cse1 (= (store v_main_a_2290 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2290 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 991) .cse1 (= .cse0 10))))) [2019-05-15 10:40:29,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 990) (= .cse0 10)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:29,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:29,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:29,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:29,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,937 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:29,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:29,938 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:29,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,950 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2291]. (let ((.cse1 (select v_main_a_2291 main_x))) (let ((.cse0 (= main_a (store v_main_a_2291 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 10) (= (select v_main_a_2291 main_y) 990))))) [2019-05-15 10:40:29,950 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 11) (= (select main_a main_y) 990)))) [2019-05-15 10:40:30,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:30,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:30,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:30,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,051 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:30,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:30,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:30,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,062 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2292]. (let ((.cse2 (select v_main_a_2292 main_y))) (let ((.cse1 (= (store v_main_a_2292 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2292 main_x))) (or (and (= .cse0 11) .cse1 (= .cse2 990)) (and (= main_y main_x) .cse1 (= .cse0 1001))))) [2019-05-15 10:40:30,062 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 989) (= .cse0 11)))) [2019-05-15 10:40:30,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:30,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:30,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:30,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,164 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:30,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:30,165 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:30,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2293]. (let ((.cse0 (select v_main_a_2293 main_x))) (let ((.cse1 (= (store v_main_a_2293 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 11) .cse1 (= (select v_main_a_2293 main_y) 989)) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:40:30,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 989) (= .cse0 12)))) [2019-05-15 10:40:30,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:30,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:30,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:30,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,257 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:30,259 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,283 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:30,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:30,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:30,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2294]. (let ((.cse2 (select v_main_a_2294 main_y))) (let ((.cse1 (select v_main_a_2294 main_x)) (.cse0 (= (store v_main_a_2294 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 12) .cse0 (= .cse2 989))))) [2019-05-15 10:40:30,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:30,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:30,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:30,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:30,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,465 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:30,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:30,466 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:30,478 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,478 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2295]. (let ((.cse0 (select v_main_a_2295 main_x))) (let ((.cse1 (= (store v_main_a_2295 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2295 main_y) 988) (= .cse0 12) .cse1)))) [2019-05-15 10:40:30,478 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 13) (= (select main_a main_y) 988)))) [2019-05-15 10:40:30,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:30,553 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:30,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:30,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,594 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:30,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:30,595 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:30,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2296]. (let ((.cse2 (select v_main_a_2296 main_y))) (let ((.cse0 (select v_main_a_2296 main_x)) (.cse1 (= (store v_main_a_2296 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 13) .cse1 (= .cse2 988)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:40:30,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:30,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:30,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:30,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:30,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,735 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:30,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:30,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:30,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,749 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2297]. (let ((.cse1 (select v_main_a_2297 main_x))) (let ((.cse0 (= main_a (store v_main_a_2297 main_x (+ .cse1 1))))) (or (and .cse0 (= (select v_main_a_2297 main_y) 987) (= .cse1 13)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:40:30,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 14) (= (select main_a main_y) 987)))) [2019-05-15 10:40:30,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:30,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:30,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:30,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,868 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:30,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:30,868 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:30,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2298]. (let ((.cse1 (select v_main_a_2298 main_y))) (let ((.cse2 (select v_main_a_2298 main_x)) (.cse0 (= main_a (store v_main_a_2298 main_y (+ .cse1 (- 1)))))) (or (and .cse0 (= .cse1 987) (= .cse2 14)) (and (= main_y main_x) (= .cse2 1001) .cse0)))) [2019-05-15 10:40:30,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 14) (= (select main_a main_y) 986)))) [2019-05-15 10:40:30,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:30,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:30,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:30,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,994 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:30,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:30,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:31,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2299]. (let ((.cse1 (select v_main_a_2299 main_x))) (let ((.cse0 (= (store v_main_a_2299 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= 1000 .cse1)) (and (= (select v_main_a_2299 main_y) 986) .cse0 (= 14 .cse1))))) [2019-05-15 10:40:31,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 15) (= (select main_a main_y) 986)))) [2019-05-15 10:40:31,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:31,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:31,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:31,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:31,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,115 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:31,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:31,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:31,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2300]. (let ((.cse2 (select v_main_a_2300 main_y))) (let ((.cse0 (= (store v_main_a_2300 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2300 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 986) (= .cse1 15))))) [2019-05-15 10:40:31,187 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:31,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:31,270 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:31,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:31,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,301 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:31,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:31,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:31,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,311 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2301]. (let ((.cse1 (select v_main_a_2301 main_x))) (let ((.cse0 (= (store v_main_a_2301 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= 15 .cse1) (= (select v_main_a_2301 main_y) 985)) (and (= main_y main_x) (= 1000 .cse1) .cse0)))) [2019-05-15 10:40:31,311 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 16) (= (select main_a main_y) 985)))) [2019-05-15 10:40:31,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:31,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:31,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:31,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,445 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:31,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:31,445 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:31,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2302]. (let ((.cse0 (select v_main_a_2302 main_y))) (let ((.cse1 (select v_main_a_2302 main_x)) (.cse2 (= (store v_main_a_2302 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 985 .cse0) (= 16 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:40:31,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 984) (= .cse0 16)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:31,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:31,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:31,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:31,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,604 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:31,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:31,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:31,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2303]. (let ((.cse0 (select v_main_a_2303 main_x))) (let ((.cse1 (= (store v_main_a_2303 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 16) (= 984 (select v_main_a_2303 main_y)) .cse1)))) [2019-05-15 10:40:31,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 984) (= .cse0 17)))) [2019-05-15 10:40:31,689 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:31,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:31,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:31,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:31,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,737 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:31,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:31,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:31,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2304]. (let ((.cse2 (select v_main_a_2304 main_y))) (let ((.cse1 (select v_main_a_2304 main_x)) (.cse0 (= main_a (store v_main_a_2304 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse1 17) .cse0 (= .cse2 984))))) [2019-05-15 10:40:31,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 983) (= .cse0 17)))) [2019-05-15 10:40:31,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:31,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:31,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:31,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,863 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:31,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:31,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:31,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2305]. (let ((.cse0 (select v_main_a_2305 main_x))) (let ((.cse1 (= (store v_main_a_2305 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 17) (= (select v_main_a_2305 main_y) 983) .cse1) (and (= main_y main_x) .cse1 (= .cse0 1000))))) [2019-05-15 10:40:31,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 983) (= .cse0 18)))) [2019-05-15 10:40:31,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:31,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:31,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:31,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,002 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:32,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:32,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:32,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2306]. (let ((.cse0 (select v_main_a_2306 main_y))) (let ((.cse2 (= (store v_main_a_2306 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_2306 main_x))) (or (and (= .cse0 983) (= .cse1 18) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:40:32,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 982) (= .cse0 18)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:32,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:32,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:32,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:32,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,175 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:32,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:32,175 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:32,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2307]. (let ((.cse0 (select v_main_a_2307 main_x))) (let ((.cse1 (= main_a (store v_main_a_2307 main_x (+ .cse0 1))))) (or (and (= .cse0 18) .cse1 (= (select v_main_a_2307 main_y) 982)) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:40:32,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 982) (= .cse0 19)))) [2019-05-15 10:40:32,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:32,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:32,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:32,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:32,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,301 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:32,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:32,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:32,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2308]. (let ((.cse2 (select v_main_a_2308 main_y))) (let ((.cse0 (= (store v_main_a_2308 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2308 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse2 982) (= .cse1 19))))) [2019-05-15 10:40:32,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 981) (= .cse0 19)))) [2019-05-15 10:40:32,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:32,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:32,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:32,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,430 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:32,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:32,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:32,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2309]. (let ((.cse1 (select v_main_a_2309 main_x))) (let ((.cse0 (= (store v_main_a_2309 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_2309 main_y) 981) (= .cse1 19))))) [2019-05-15 10:40:32,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 981) (= .cse0 20)))) [2019-05-15 10:40:32,514 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:32,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:32,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:32,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:32,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,573 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:32,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:32,573 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:32,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2310]. (let ((.cse2 (select v_main_a_2310 main_y))) (let ((.cse0 (select v_main_a_2310 main_x)) (.cse1 (= (store v_main_a_2310 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse0 20) (= 981 .cse2) .cse1)))) [2019-05-15 10:40:32,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:32,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:32,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:32,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,749 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:32,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,775 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:32,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:32,775 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:32,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2311]. (let ((.cse0 (select v_main_a_2311 main_x))) (let ((.cse1 (= main_a (store v_main_a_2311 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 20) (= (select v_main_a_2311 main_y) 980) .cse1)))) [2019-05-15 10:40:32,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 21) (= (select main_a main_y) 980)))) [2019-05-15 10:40:32,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:32,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:32,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:32,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,911 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:32,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:32,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:32,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2312]. (let ((.cse1 (select v_main_a_2312 main_y))) (let ((.cse2 (select v_main_a_2312 main_x)) (.cse0 (= (store v_main_a_2312 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= .cse1 980) (= .cse2 21)) (and (= main_y main_x) (= .cse2 1001) .cse0)))) [2019-05-15 10:40:32,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:33,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:33,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:33,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:33,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,119 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:33,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:33,120 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:33,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2313]. (let ((.cse1 (select v_main_a_2313 main_x))) (let ((.cse0 (= (store v_main_a_2313 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= main_y main_x) (= .cse1 1000)) (and .cse0 (= (select v_main_a_2313 main_y) 979) (= .cse1 21))))) [2019-05-15 10:40:33,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 22) (= (select main_a main_y) 979)))) [2019-05-15 10:40:33,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:33,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:33,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:33,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,225 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:33,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,261 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:33,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:33,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:33,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2314]. (let ((.cse2 (select v_main_a_2314 main_y))) (let ((.cse0 (select v_main_a_2314 main_x)) (.cse1 (= (store v_main_a_2314 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 22 .cse0) .cse1 (= 979 .cse2))))) [2019-05-15 10:40:33,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 978) (= .cse0 22)))) [2019-05-15 10:40:33,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:33,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:33,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:33,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,393 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:33,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:33,394 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:33,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2315]. (let ((.cse0 (select v_main_a_2315 main_x))) (let ((.cse1 (= (store v_main_a_2315 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= (select v_main_a_2315 main_y) 978) (= .cse0 22))))) [2019-05-15 10:40:33,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 23) (= (select main_a main_y) 978)))) [2019-05-15 10:40:33,485 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:33,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:33,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:33,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,506 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:33,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,543 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:33,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:33,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:33,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2316]. (let ((.cse2 (select v_main_a_2316 main_y))) (let ((.cse1 (select v_main_a_2316 main_x)) (.cse0 (= main_a (store v_main_a_2316 main_y (+ .cse2 (- 1)))))) (or (and (= main_y main_x) .cse0 (= 1001 .cse1)) (and (= .cse2 978) (= 23 .cse1) .cse0)))) [2019-05-15 10:40:33,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:33,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:33,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:33,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:33,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,755 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:33,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:33,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:33,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2317]. (let ((.cse1 (select v_main_a_2317 main_x))) (let ((.cse0 (= (store v_main_a_2317 main_x (+ .cse1 1)) main_a))) (or (and (= 977 (select v_main_a_2317 main_y)) .cse0 (= 23 .cse1)) (and (= main_y main_x) .cse0 (= 1000 .cse1))))) [2019-05-15 10:40:33,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 977) (= .cse0 24)))) [2019-05-15 10:40:33,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:33,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:33,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:33,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:33,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,892 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:33,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:33,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:33,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2318]. (let ((.cse2 (select v_main_a_2318 main_y))) (let ((.cse0 (select v_main_a_2318 main_x)) (.cse1 (= (store v_main_a_2318 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) (= 1001 .cse0) .cse1) (and (= 977 .cse2) (= 24 .cse0) .cse1)))) [2019-05-15 10:40:33,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 976) (= .cse0 24)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:34,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:34,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:34,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:34,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,072 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:34,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:34,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:34,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2319]. (let ((.cse1 (select v_main_a_2319 main_x))) (let ((.cse0 (= (store v_main_a_2319 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 24) (= (select v_main_a_2319 main_y) 976))))) [2019-05-15 10:40:34,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 976) (= .cse0 25)))) [2019-05-15 10:40:34,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:34,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:34,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:34,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:34,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,218 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:34,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:34,218 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:34,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2320]. (let ((.cse2 (select v_main_a_2320 main_y))) (let ((.cse1 (select v_main_a_2320 main_x)) (.cse0 (= (store v_main_a_2320 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 976) (= .cse1 25) .cse0)))) [2019-05-15 10:40:34,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:34,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:34,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:34,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:34,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,414 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:34,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:34,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:34,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2321]. (let ((.cse0 (select v_main_a_2321 main_x))) (let ((.cse1 (= (store v_main_a_2321 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 25) (= (select v_main_a_2321 main_y) 975) .cse1)))) [2019-05-15 10:40:34,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 26) (= (select main_a main_y) 975)))) [2019-05-15 10:40:34,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:34,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:34,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:34,537 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,560 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:34,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:34,561 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:34,635 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2322]. (let ((.cse0 (select v_main_a_2322 main_y))) (let ((.cse2 (select v_main_a_2322 main_x)) (.cse1 (= (store v_main_a_2322 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 975 .cse0) .cse1 (= .cse2 26)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:40:34,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 974) (= .cse0 26)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:34,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:34,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:34,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,749 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:34,751 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,775 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:34,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:34,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:34,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2323]. (let ((.cse0 (select v_main_a_2323 main_x))) (let ((.cse1 (= main_a (store v_main_a_2323 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 26) .cse1 (= (select v_main_a_2323 main_y) 974))))) [2019-05-15 10:40:34,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 974) (= .cse0 27)))) [2019-05-15 10:40:34,873 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:34,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:34,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:34,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:34,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,920 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:34,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:34,921 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:34,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2324]. (let ((.cse2 (select v_main_a_2324 main_y))) (let ((.cse1 (= (store v_main_a_2324 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2324 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 974) .cse1 (= .cse0 27))))) [2019-05-15 10:40:34,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:35,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:35,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:35,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:35,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:35,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,133 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:35,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:35,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:35,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:35,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2325]. (let ((.cse1 (select v_main_a_2325 main_x))) (let ((.cse0 (= (store v_main_a_2325 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= .cse1 27) (= (select v_main_a_2325 main_y) 973))))) [2019-05-15 10:40:35,142 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 28) (= (select main_a main_y) 973)))) [2019-05-15 10:40:35,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:35,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:35,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:35,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:35,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:35,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,280 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:35,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:35,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:35,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:35,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2326]. (let ((.cse2 (select v_main_a_2326 main_y))) (let ((.cse0 (= (store v_main_a_2326 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2326 main_x))) (or (and .cse0 (= main_y main_x) (= .cse1 1001)) (and .cse0 (= .cse2 973) (= .cse1 28))))) [2019-05-15 10:40:35,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 972) (= .cse0 28)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:35,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:35,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:35,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:35,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:35,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,465 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:35,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:35,466 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:35,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:35,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2327]. (let ((.cse0 (select v_main_a_2327 main_x))) (let ((.cse1 (= (store v_main_a_2327 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 972 (select v_main_a_2327 main_y)) .cse1 (= 28 .cse0))))) [2019-05-15 10:40:35,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 29) (= (select main_a main_y) 972)))) [2019-05-15 10:40:35,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:35,587 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:35,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:35,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:35,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,619 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:35,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:35,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:35,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:35,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2328]. (let ((.cse2 (select v_main_a_2328 main_y))) (let ((.cse0 (= (store v_main_a_2328 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2328 main_x))) (or (and .cse0 (= 29 .cse1) (= 972 .cse2)) (and (= main_y main_x) .cse0 (= 1001 .cse1))))) [2019-05-15 10:40:35,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:35,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:35,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:35,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:35,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:35,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,816 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:35,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:35,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:35,828 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:35,829 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2329]. (let ((.cse1 (select v_main_a_2329 main_x))) (let ((.cse0 (= (store v_main_a_2329 main_x (+ .cse1 1)) main_a))) (or (and (= 971 (select v_main_a_2329 main_y)) .cse0 (= .cse1 29)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:40:35,829 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 971) (= .cse0 30)))) [2019-05-15 10:40:35,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:35,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:35,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:35,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:35,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:35,983 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:35,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:35,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:36,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,030 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2330]. (let ((.cse1 (select v_main_a_2330 main_y))) (let ((.cse2 (select v_main_a_2330 main_x)) (.cse0 (= (store v_main_a_2330 main_y (+ .cse1 (- 1))) main_a))) (or (and .cse0 (= .cse1 971) (= .cse2 30)) (and (= main_y main_x) (= .cse2 1001) .cse0)))) [2019-05-15 10:40:36,030 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:36,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:36,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:36,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,148 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:36,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,185 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:36,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:36,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:36,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2331]. (let ((.cse0 (select v_main_a_2331 main_x))) (let ((.cse1 (= main_a (store v_main_a_2331 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 30) (= (select v_main_a_2331 main_y) 970) .cse1)))) [2019-05-15 10:40:36,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 31) (= (select main_a main_y) 970)))) [2019-05-15 10:40:36,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:36,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:36,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:36,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,360 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:36,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:36,361 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:36,415 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,415 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2332]. (let ((.cse1 (select v_main_a_2332 main_y))) (let ((.cse2 (= (store v_main_a_2332 main_y (+ .cse1 (- 1))) main_a)) (.cse0 (select v_main_a_2332 main_x))) (or (and (= .cse0 31) (= .cse1 970) .cse2) (and (= main_y main_x) .cse2 (= .cse0 1001))))) [2019-05-15 10:40:36,415 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 969) (= .cse0 31)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:36,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:36,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:36,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:36,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,570 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:36,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:36,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:36,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2333]. (let ((.cse0 (select v_main_a_2333 main_x))) (let ((.cse1 (= main_a (store v_main_a_2333 main_x (+ .cse0 1))))) (or (and (= (select v_main_a_2333 main_y) 969) (= .cse0 31) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:40:36,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 969) (= .cse0 32)))) [2019-05-15 10:40:36,683 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:36,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:36,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:36,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:36,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,729 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:36,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:36,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:36,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2334]. (let ((.cse2 (select v_main_a_2334 main_y))) (let ((.cse1 (= (store v_main_a_2334 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2334 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and (= .cse2 969) .cse1 (= .cse0 32))))) [2019-05-15 10:40:36,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 968) (= .cse0 32)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:36,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:36,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:36,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:36,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,942 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:36,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:36,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:36,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2335]. (let ((.cse1 (select v_main_a_2335 main_x))) (let ((.cse0 (= (store v_main_a_2335 main_x (+ .cse1 1)) main_a))) (or (and .cse0 (= (select v_main_a_2335 main_y) 968) (= .cse1 32)) (and .cse0 (= main_y main_x) (= .cse1 1000))))) [2019-05-15 10:40:36,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 968) (= .cse0 33)))) [2019-05-15 10:40:37,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:37,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:37,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:37,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,111 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:37,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:37,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:37,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2336]. (let ((.cse2 (select v_main_a_2336 main_y))) (let ((.cse0 (select v_main_a_2336 main_x)) (.cse1 (= (store v_main_a_2336 main_y (+ .cse2 (- 1))) main_a))) (or (and (= .cse0 33) .cse1 (= .cse2 968)) (and (= main_y main_x) (= .cse0 1001) .cse1)))) [2019-05-15 10:40:37,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 967) (= .cse0 33)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:37,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:37,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:37,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:37,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,341 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:37,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:37,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:37,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2337]. (let ((.cse0 (select v_main_a_2337 main_x))) (let ((.cse1 (= (store v_main_a_2337 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 33) .cse1 (= 967 (select v_main_a_2337 main_y))) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:40:37,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 34) (= (select main_a main_y) 967)))) [2019-05-15 10:40:37,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:37,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:37,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:37,486 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,520 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:37,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:37,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:37,609 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2338]. (let ((.cse1 (select v_main_a_2338 main_y))) (let ((.cse0 (= (store v_main_a_2338 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_2338 main_x))) (or (and .cse0 (= .cse1 967) (= .cse2 34)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:40:37,610 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 34) (= (select main_a main_y) 966)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:37,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:37,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:37,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:37,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,765 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:37,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:37,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:37,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2339]. (let ((.cse0 (select v_main_a_2339 main_x))) (let ((.cse1 (= (store v_main_a_2339 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 34) .cse1 (= 966 (select v_main_a_2339 main_y)))))) [2019-05-15 10:40:37,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 966) (= .cse0 35)))) [2019-05-15 10:40:37,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:37,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:37,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:37,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,934 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:37,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:37,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:37,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2340]. (let ((.cse0 (select v_main_a_2340 main_y))) (let ((.cse2 (= (store v_main_a_2340 main_y (+ .cse0 (- 1))) main_a)) (.cse1 (select v_main_a_2340 main_x))) (or (and (= .cse0 966) (= .cse1 35) .cse2) (and (= main_y main_x) .cse2 (= .cse1 1001))))) [2019-05-15 10:40:37,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 965) (= .cse0 35)))) [2019-05-15 10:40:38,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:38,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:38,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:38,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,109 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:38,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:38,110 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:38,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2341]. (let ((.cse0 (select v_main_a_2341 main_x))) (let ((.cse1 (= (store v_main_a_2341 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 35) .cse1 (= 965 (select v_main_a_2341 main_y)))))) [2019-05-15 10:40:38,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 965) (= .cse0 36)))) [2019-05-15 10:40:38,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:38,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:38,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:38,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,280 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:38,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:38,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:38,355 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,355 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2342]. (let ((.cse1 (select v_main_a_2342 main_y))) (let ((.cse0 (select v_main_a_2342 main_x)) (.cse2 (= (store v_main_a_2342 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 36) (= .cse1 965) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:40:38,355 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= (select main_a main_y) 964) (= .cse0 36)))) [2019-05-15 10:40:38,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:38,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:38,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:38,486 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,510 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:38,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:38,511 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:38,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2343]. (let ((.cse0 (select v_main_a_2343 main_x))) (let ((.cse1 (= (store v_main_a_2343 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= (select v_main_a_2343 main_y) 964) (= .cse0 36) .cse1)))) [2019-05-15 10:40:38,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 964) (= .cse0 37)))) [2019-05-15 10:40:38,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:38,656 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:38,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:38,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,689 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:38,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:38,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:38,762 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2344]. (let ((.cse0 (select v_main_a_2344 main_y))) (let ((.cse1 (select v_main_a_2344 main_x)) (.cse2 (= main_a (store v_main_a_2344 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 964) (= .cse1 37) .cse2) (and (= main_y main_x) (= .cse1 1001) .cse2)))) [2019-05-15 10:40:38,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:38,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:38,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:38,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:38,899 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,933 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:38,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:38,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:38,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2345]. (let ((.cse1 (select v_main_a_2345 main_x))) (let ((.cse0 (= (store v_main_a_2345 main_x (+ .cse1 1)) main_a))) (or (and (= 963 (select v_main_a_2345 main_y)) .cse0 (= .cse1 37)) (and (= main_y main_x) (= .cse1 1000) .cse0)))) [2019-05-15 10:40:38,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 38) (= (select main_a main_y) 963)))) [2019-05-15 10:40:39,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:39,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:39,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:39,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,117 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:39,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:39,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:39,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2346]. (let ((.cse2 (select v_main_a_2346 main_y))) (let ((.cse0 (= (store v_main_a_2346 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2346 main_x))) (or (and .cse0 (= 38 .cse1) (= 963 .cse2)) (and .cse0 (= main_y main_x) (= 1001 .cse1))))) [2019-05-15 10:40:39,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 38) (= (select main_a main_y) 962)))) [2019-05-15 10:40:39,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:39,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:39,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,270 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:39,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,309 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:39,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:39,309 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:39,320 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2347]. (let ((.cse1 (select v_main_a_2347 main_x))) (let ((.cse0 (= (store v_main_a_2347 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= .cse1 38) .cse0 (= (select v_main_a_2347 main_y) 962))))) [2019-05-15 10:40:39,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 39) (= (select main_a main_y) 962)))) [2019-05-15 10:40:39,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:39,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:39,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:39,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,457 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:39,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,484 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:39,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:39,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:39,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2348]. (let ((.cse2 (select v_main_a_2348 main_y))) (let ((.cse1 (select v_main_a_2348 main_x)) (.cse0 (= (store v_main_a_2348 main_y (+ .cse2 (- 1))) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 962) (= .cse1 39) .cse0)))) [2019-05-15 10:40:39,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 961) (= .cse0 39)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:39,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:39,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:39,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:39,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,731 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:39,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:39,731 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:39,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,743 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2349]. (let ((.cse0 (select v_main_a_2349 main_x))) (let ((.cse1 (= main_a (store v_main_a_2349 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and .cse1 (= (select v_main_a_2349 main_y) 961) (= .cse0 39))))) [2019-05-15 10:40:39,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 961) (= .cse0 40)))) [2019-05-15 10:40:39,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:39,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:39,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:39,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:39,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,910 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:39,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:39,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:39,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2350]. (let ((.cse2 (select v_main_a_2350 main_y))) (let ((.cse0 (= (store v_main_a_2350 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2350 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and (= .cse2 961) .cse0 (= .cse1 40))))) [2019-05-15 10:40:39,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:40,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:40,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:40,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:40,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,174 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:40,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:40,175 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:40,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,187 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2351]. (let ((.cse1 (select v_main_a_2351 main_x))) (let ((.cse0 (= main_a (store v_main_a_2351 main_x (+ .cse1 1))))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and .cse0 (= (select v_main_a_2351 main_y) 960) (= .cse1 40))))) [2019-05-15 10:40:40,187 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 41) (= (select main_a main_y) 960)))) [2019-05-15 10:40:40,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:40,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:40,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:40,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,371 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:40,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:40,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:40,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2352]. (let ((.cse0 (select v_main_a_2352 main_y))) (let ((.cse1 (select v_main_a_2352 main_x)) (.cse2 (= (store v_main_a_2352 main_y (+ .cse0 (- 1))) main_a))) (or (and (= 960 .cse0) (= 41 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse1) .cse2)))) [2019-05-15 10:40:40,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 959) (= .cse0 41)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:40,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:40,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:40,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:40,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,589 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:40,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:40,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:40,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2353]. (let ((.cse1 (select v_main_a_2353 main_x))) (let ((.cse0 (= (store v_main_a_2353 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 959 (select v_main_a_2353 main_y)) .cse0 (= .cse1 41))))) [2019-05-15 10:40:40,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 959) (= .cse0 42)))) [2019-05-15 10:40:40,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:40,741 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:40,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:40,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,773 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:40,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:40,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:40,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2354]. (let ((.cse1 (select v_main_a_2354 main_y))) (let ((.cse0 (select v_main_a_2354 main_x)) (.cse2 (= (store v_main_a_2354 main_y (+ .cse1 (- 1))) main_a))) (or (and (= 42 .cse0) (= 959 .cse1) .cse2) (and (= main_y main_x) (= 1001 .cse0) .cse2)))) [2019-05-15 10:40:40,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:40,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:40,951 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:40,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:40,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,994 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:40,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:40,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:41,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2355]. (let ((.cse0 (select v_main_a_2355 main_x))) (let ((.cse1 (= (store v_main_a_2355 main_x (+ .cse0 1)) main_a))) (or (and (= .cse0 42) (= (select v_main_a_2355 main_y) 958) .cse1) (and (= main_y main_x) (= .cse0 1000) .cse1)))) [2019-05-15 10:40:41,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 43) (= (select main_a main_y) 958)))) [2019-05-15 10:40:41,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:41,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:41,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:41,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:41,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,185 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:41,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:41,185 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:41,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2356]. (let ((.cse2 (select v_main_a_2356 main_y))) (let ((.cse0 (= (store v_main_a_2356 main_y (+ .cse2 (- 1))) main_a)) (.cse1 (select v_main_a_2356 main_x))) (or (and (= main_y main_x) .cse0 (= .cse1 1001)) (and .cse0 (= .cse1 43) (= .cse2 958))))) [2019-05-15 10:40:41,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:41,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:41,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:41,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:41,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,397 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:41,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:41,397 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:41,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2357]. (let ((.cse0 (select v_main_a_2357 main_x))) (let ((.cse1 (= (store v_main_a_2357 main_x (+ .cse0 1)) main_a))) (or (and (= main_y main_x) (= .cse0 1000) .cse1) (and (= .cse0 43) (= (select v_main_a_2357 main_y) 957) .cse1)))) [2019-05-15 10:40:41,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 44) (= (select main_a main_y) 957)))) [2019-05-15 10:40:41,534 INFO L172 IndexEqualityManager]: detected equality via solver [2019-05-15 10:40:41,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:41,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:41,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:41,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,584 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:41,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:41,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:41,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2358]. (let ((.cse2 (select v_main_a_2358 main_y))) (let ((.cse1 (= (store v_main_a_2358 main_y (+ .cse2 (- 1))) main_a)) (.cse0 (select v_main_a_2358 main_x))) (or (and (= main_y main_x) (= .cse0 1001) .cse1) (and .cse1 (= .cse0 44) (= .cse2 957))))) [2019-05-15 10:40:41,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 956) (= .cse0 44)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:41,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:41,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:41,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,811 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:41,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,837 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:41,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:41,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:41,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,847 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2359]. (let ((.cse1 (select v_main_a_2359 main_x))) (let ((.cse0 (= (store v_main_a_2359 main_x (+ .cse1 1)) main_a))) (or (and (= main_y main_x) .cse0 (= .cse1 1000)) (and (= 956 (select v_main_a_2359 main_y)) .cse0 (= .cse1 44))))) [2019-05-15 10:40:41,847 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= (select main_a main_y) 956) (= .cse0 45)))) [2019-05-15 10:40:41,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:41,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:41,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:41,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,035 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:42,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:42,035 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:42,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:42,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2360]. (let ((.cse1 (select v_main_a_2360 main_y))) (let ((.cse0 (= (store v_main_a_2360 main_y (+ .cse1 (- 1))) main_a)) (.cse2 (select v_main_a_2360 main_x))) (or (and .cse0 (= 956 .cse1) (= .cse2 45)) (and (= main_y main_x) .cse0 (= .cse2 1001))))) [2019-05-15 10:40:42,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= (select main_a main_y) 955) (= .cse0 45)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:42,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:42,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:42,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,252 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:42,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:42,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,287 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:42,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:42,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:42,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:42,300 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2361]. (let ((.cse0 (select v_main_a_2361 main_x))) (let ((.cse1 (= main_a (store v_main_a_2361 main_x (+ .cse0 1))))) (or (and (= main_y main_x) (= 1000 .cse0) .cse1) (and (= 45 .cse0) (= 955 (select v_main_a_2361 main_y)) .cse1)))) [2019-05-15 10:40:42,300 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 46) (= (select main_a main_y) 955)))) [2019-05-15 10:40:42,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:42,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:42,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:42,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:42,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,479 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:42,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:42,480 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:42,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:42,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2362]. (let ((.cse0 (select v_main_a_2362 main_y))) (let ((.cse2 (select v_main_a_2362 main_x)) (.cse1 (= main_a (store v_main_a_2362 main_y (+ .cse0 (- 1)))))) (or (and (= .cse0 955) .cse1 (= .cse2 46)) (and (= main_y main_x) (= .cse2 1001) .cse1)))) [2019-05-15 10:40:42,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1000)) (and (= .cse0 46) (= (select main_a main_y) 954)))) [2019-05-15 10:40:42,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:42,654 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:42,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:42,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2019-05-15 10:40:42,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,683 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:42,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:42,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:42,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:42,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2363]. (let ((.cse1 (select v_main_a_2363 main_x))) (let ((.cse0 (= (store v_main_a_2363 main_x (+ .cse1 1)) main_a))) (or (and (= (select v_main_a_2363 main_y) 954) .cse0 (= .cse1 46)) (and (= main_y main_x) .cse0 (= .cse1 1000))))) [2019-05-15 10:40:42,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= main_y main_x) (= .cse0 1001)) (and (= .cse0 47) (= (select main_a main_y) 954)))) [2019-05-15 10:40:42,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:40:42,844 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:42,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 43 [2019-05-15 10:40:42,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-05-15 10:40:42,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:42,887 INFO L567 ElimStorePlain]: treesize reduction 18, result has 53.8 percent of original size [2019-05-15 10:40:42,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-05-15 10:40:42,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:21 [2019-05-15 10:40:42,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:42,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_main_a_2364]. (let ((.cse1 (select v_main_a_2364 main_y))) (let ((.cse0 (select v_main_a_2364 main_x)) (.cse2 (= (store v_main_a_2364 main_y (+ .cse1 (- 1))) main_a))) (or (and (= .cse0 47) (= 954 .cse1) .cse2) (and (= main_y main_x) (= .cse0 1001) .cse2)))) [2019-05-15 10:40:42,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select main_a main_x))) (or (and (= .cse0 47) (= (select main_a main_y) 953)) (and (= main_y main_x) (= .cse0 1000)))) [2019-05-15 10:40:43,063 INFO L273 TraceCheckUtils]: 0: Hoare triple {19332#true} a := a[x := 0]; {19337#(= (select main_a main_x) 0)} is VALID [2019-05-15 10:40:43,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {19337#(= (select main_a main_x) 0)} a := a[y := 1000]; {19341#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-05-15 10:40:43,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {19341#(and (or (= main_y main_x) (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} a := a[x := a[x] + 1]; {19345#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} is VALID [2019-05-15 10:40:43,066 INFO L273 TraceCheckUtils]: 3: Hoare triple {19345#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 1000) (= (select main_a main_x) 1)))} a := a[y := a[y] - 1]; {19349#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,067 INFO L273 TraceCheckUtils]: 4: Hoare triple {19349#(or (and (= (select main_a main_y) 999) (= (select main_a main_x) 1)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19353#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} is VALID [2019-05-15 10:40:43,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {19353#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 2) (= (select main_a main_y) 999)))} a := a[y := a[y] - 1]; {19357#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {19357#(or (and (= (select main_a main_x) 2) (= (select main_a main_y) 998)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19361#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} is VALID [2019-05-15 10:40:43,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {19361#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 3) (= (select main_a main_y) 998)))} a := a[y := a[y] - 1]; {19365#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {19365#(or (and (= (select main_a main_y) 997) (= (select main_a main_x) 3)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19369#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} is VALID [2019-05-15 10:40:43,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {19369#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 997) (= (select main_a main_x) 4)))} a := a[y := a[y] - 1]; {19373#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {19373#(or (and (= (select main_a main_y) 996) (= (select main_a main_x) 4)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19377#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} is VALID [2019-05-15 10:40:43,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {19377#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 5) (= (select main_a main_y) 996)))} a := a[y := a[y] - 1]; {19381#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {19381#(or (and (= (select main_a main_x) 5) (= (select main_a main_y) 995)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19385#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} is VALID [2019-05-15 10:40:43,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {19385#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 995)))} a := a[y := a[y] - 1]; {19389#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} is VALID [2019-05-15 10:40:43,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {19389#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 6) (= (select main_a main_y) 994)))} a := a[x := a[x] + 1]; {19393#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} is VALID [2019-05-15 10:40:43,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {19393#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 994) (= (select main_a main_x) 7)))} a := a[y := a[y] - 1]; {19397#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:40:43,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {19397#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 7) (= (select main_a main_y) 993)))} a := a[x := a[x] + 1]; {19401#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} is VALID [2019-05-15 10:40:43,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {19401#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 993)))} a := a[y := a[y] - 1]; {19405#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:40:43,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {19405#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 8) (= (select main_a main_y) 992)))} a := a[x := a[x] + 1]; {19409#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} is VALID [2019-05-15 10:40:43,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {19409#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 9) (= (select main_a main_y) 992)))} a := a[y := a[y] - 1]; {19413#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {19413#(or (and (= (select main_a main_x) 9) (= (select main_a main_y) 991)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19417#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} is VALID [2019-05-15 10:40:43,087 INFO L273 TraceCheckUtils]: 21: Hoare triple {19417#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 991) (= (select main_a main_x) 10)))} a := a[y := a[y] - 1]; {19421#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {19421#(or (and (= (select main_a main_y) 990) (= (select main_a main_x) 10)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19425#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} is VALID [2019-05-15 10:40:43,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {19425#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 11) (= (select main_a main_y) 990)))} a := a[y := a[y] - 1]; {19429#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} is VALID [2019-05-15 10:40:43,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {19429#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 11)))} a := a[x := a[x] + 1]; {19433#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} is VALID [2019-05-15 10:40:43,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {19433#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 989) (= (select main_a main_x) 12)))} a := a[y := a[y] - 1]; {19437#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {19437#(or (and (= (select main_a main_x) 12) (= (select main_a main_y) 988)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19441#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} is VALID [2019-05-15 10:40:43,094 INFO L273 TraceCheckUtils]: 27: Hoare triple {19441#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 13) (= (select main_a main_y) 988)))} a := a[y := a[y] - 1]; {19445#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,095 INFO L273 TraceCheckUtils]: 28: Hoare triple {19445#(or (and (= (select main_a main_x) 13) (= (select main_a main_y) 987)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19449#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} is VALID [2019-05-15 10:40:43,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {19449#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 987)))} a := a[y := a[y] - 1]; {19453#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:40:43,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {19453#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 14) (= (select main_a main_y) 986)))} a := a[x := a[x] + 1]; {19457#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} is VALID [2019-05-15 10:40:43,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {19457#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 15) (= (select main_a main_y) 986)))} a := a[y := a[y] - 1]; {19461#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {19461#(or (and (= (select main_a main_x) 15) (= (select main_a main_y) 985)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19465#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} is VALID [2019-05-15 10:40:43,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {19465#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 16) (= (select main_a main_y) 985)))} a := a[y := a[y] - 1]; {19469#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {19469#(or (and (= (select main_a main_y) 984) (= (select main_a main_x) 16)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19473#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:40:43,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {19473#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 984) (= (select main_a main_x) 17)))} a := a[y := a[y] - 1]; {19477#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} is VALID [2019-05-15 10:40:43,104 INFO L273 TraceCheckUtils]: 36: Hoare triple {19477#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 17)))} a := a[x := a[x] + 1]; {19481#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} is VALID [2019-05-15 10:40:43,105 INFO L273 TraceCheckUtils]: 37: Hoare triple {19481#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 983) (= (select main_a main_x) 18)))} a := a[y := a[y] - 1]; {19485#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,106 INFO L273 TraceCheckUtils]: 38: Hoare triple {19485#(or (and (= (select main_a main_y) 982) (= (select main_a main_x) 18)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19489#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:40:43,107 INFO L273 TraceCheckUtils]: 39: Hoare triple {19489#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 982) (= (select main_a main_x) 19)))} a := a[y := a[y] - 1]; {19493#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} is VALID [2019-05-15 10:40:43,108 INFO L273 TraceCheckUtils]: 40: Hoare triple {19493#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 19)))} a := a[x := a[x] + 1]; {19497#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} is VALID [2019-05-15 10:40:43,109 INFO L273 TraceCheckUtils]: 41: Hoare triple {19497#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 981) (= (select main_a main_x) 20)))} a := a[y := a[y] - 1]; {19501#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,111 INFO L273 TraceCheckUtils]: 42: Hoare triple {19501#(or (and (= (select main_a main_x) 20) (= (select main_a main_y) 980)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19505#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} is VALID [2019-05-15 10:40:43,112 INFO L273 TraceCheckUtils]: 43: Hoare triple {19505#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 21) (= (select main_a main_y) 980)))} a := a[y := a[y] - 1]; {19509#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,113 INFO L273 TraceCheckUtils]: 44: Hoare triple {19509#(or (and (= (select main_a main_x) 21) (= (select main_a main_y) 979)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19513#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} is VALID [2019-05-15 10:40:43,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {19513#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 22) (= (select main_a main_y) 979)))} a := a[y := a[y] - 1]; {19517#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} is VALID [2019-05-15 10:40:43,115 INFO L273 TraceCheckUtils]: 46: Hoare triple {19517#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 978) (= (select main_a main_x) 22)))} a := a[x := a[x] + 1]; {19521#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} is VALID [2019-05-15 10:40:43,116 INFO L273 TraceCheckUtils]: 47: Hoare triple {19521#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 23) (= (select main_a main_y) 978)))} a := a[y := a[y] - 1]; {19525#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,117 INFO L273 TraceCheckUtils]: 48: Hoare triple {19525#(or (and (= (select main_a main_x) 23) (= (select main_a main_y) 977)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19529#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} is VALID [2019-05-15 10:40:43,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {19529#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 977) (= (select main_a main_x) 24)))} a := a[y := a[y] - 1]; {19533#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,120 INFO L273 TraceCheckUtils]: 50: Hoare triple {19533#(or (and (= (select main_a main_y) 976) (= (select main_a main_x) 24)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19537#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} is VALID [2019-05-15 10:40:43,121 INFO L273 TraceCheckUtils]: 51: Hoare triple {19537#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 976) (= (select main_a main_x) 25)))} a := a[y := a[y] - 1]; {19541#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,122 INFO L273 TraceCheckUtils]: 52: Hoare triple {19541#(or (and (= (select main_a main_x) 25) (= (select main_a main_y) 975)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19545#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} is VALID [2019-05-15 10:40:43,123 INFO L273 TraceCheckUtils]: 53: Hoare triple {19545#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 26) (= (select main_a main_y) 975)))} a := a[y := a[y] - 1]; {19549#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,124 INFO L273 TraceCheckUtils]: 54: Hoare triple {19549#(or (and (= (select main_a main_y) 974) (= (select main_a main_x) 26)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19553#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} is VALID [2019-05-15 10:40:43,125 INFO L273 TraceCheckUtils]: 55: Hoare triple {19553#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 974) (= (select main_a main_x) 27)))} a := a[y := a[y] - 1]; {19557#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,126 INFO L273 TraceCheckUtils]: 56: Hoare triple {19557#(or (and (= (select main_a main_x) 27) (= (select main_a main_y) 973)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19561#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} is VALID [2019-05-15 10:40:43,127 INFO L273 TraceCheckUtils]: 57: Hoare triple {19561#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 28) (= (select main_a main_y) 973)))} a := a[y := a[y] - 1]; {19565#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,129 INFO L273 TraceCheckUtils]: 58: Hoare triple {19565#(or (and (= (select main_a main_y) 972) (= (select main_a main_x) 28)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19569#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} is VALID [2019-05-15 10:40:43,130 INFO L273 TraceCheckUtils]: 59: Hoare triple {19569#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 29) (= (select main_a main_y) 972)))} a := a[y := a[y] - 1]; {19573#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,131 INFO L273 TraceCheckUtils]: 60: Hoare triple {19573#(or (and (= (select main_a main_x) 29) (= (select main_a main_y) 971)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19577#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} is VALID [2019-05-15 10:40:43,132 INFO L273 TraceCheckUtils]: 61: Hoare triple {19577#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 971) (= (select main_a main_x) 30)))} a := a[y := a[y] - 1]; {19581#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,133 INFO L273 TraceCheckUtils]: 62: Hoare triple {19581#(or (and (= (select main_a main_x) 30) (= (select main_a main_y) 970)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19585#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} is VALID [2019-05-15 10:40:43,134 INFO L273 TraceCheckUtils]: 63: Hoare triple {19585#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 31) (= (select main_a main_y) 970)))} a := a[y := a[y] - 1]; {19589#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,135 INFO L273 TraceCheckUtils]: 64: Hoare triple {19589#(or (and (= (select main_a main_x) 31) (= (select main_a main_y) 969)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19593#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} is VALID [2019-05-15 10:40:43,137 INFO L273 TraceCheckUtils]: 65: Hoare triple {19593#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 969) (= (select main_a main_x) 32)))} a := a[y := a[y] - 1]; {19597#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,138 INFO L273 TraceCheckUtils]: 66: Hoare triple {19597#(or (and (= (select main_a main_y) 968) (= (select main_a main_x) 32)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19601#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} is VALID [2019-05-15 10:40:43,139 INFO L273 TraceCheckUtils]: 67: Hoare triple {19601#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 968) (= (select main_a main_x) 33)))} a := a[y := a[y] - 1]; {19605#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,140 INFO L273 TraceCheckUtils]: 68: Hoare triple {19605#(or (and (= (select main_a main_y) 967) (= (select main_a main_x) 33)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19609#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} is VALID [2019-05-15 10:40:43,141 INFO L273 TraceCheckUtils]: 69: Hoare triple {19609#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 967)))} a := a[y := a[y] - 1]; {19613#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} is VALID [2019-05-15 10:40:43,142 INFO L273 TraceCheckUtils]: 70: Hoare triple {19613#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 34) (= (select main_a main_y) 966)))} a := a[x := a[x] + 1]; {19617#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:40:43,143 INFO L273 TraceCheckUtils]: 71: Hoare triple {19617#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 966) (= (select main_a main_x) 35)))} a := a[y := a[y] - 1]; {19621#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} is VALID [2019-05-15 10:40:43,145 INFO L273 TraceCheckUtils]: 72: Hoare triple {19621#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 35)))} a := a[x := a[x] + 1]; {19625#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:40:43,146 INFO L273 TraceCheckUtils]: 73: Hoare triple {19625#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 965) (= (select main_a main_x) 36)))} a := a[y := a[y] - 1]; {19629#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} is VALID [2019-05-15 10:40:43,147 INFO L273 TraceCheckUtils]: 74: Hoare triple {19629#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 36)))} a := a[x := a[x] + 1]; {19633#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} is VALID [2019-05-15 10:40:43,148 INFO L273 TraceCheckUtils]: 75: Hoare triple {19633#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 964) (= (select main_a main_x) 37)))} a := a[y := a[y] - 1]; {19637#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,149 INFO L273 TraceCheckUtils]: 76: Hoare triple {19637#(or (and (= (select main_a main_x) 37) (= (select main_a main_y) 963)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19641#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} is VALID [2019-05-15 10:40:43,150 INFO L273 TraceCheckUtils]: 77: Hoare triple {19641#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 963)))} a := a[y := a[y] - 1]; {19645#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:40:43,151 INFO L273 TraceCheckUtils]: 78: Hoare triple {19645#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 38) (= (select main_a main_y) 962)))} a := a[x := a[x] + 1]; {19649#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} is VALID [2019-05-15 10:40:43,152 INFO L273 TraceCheckUtils]: 79: Hoare triple {19649#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 39) (= (select main_a main_y) 962)))} a := a[y := a[y] - 1]; {19653#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,154 INFO L273 TraceCheckUtils]: 80: Hoare triple {19653#(or (and (= (select main_a main_y) 961) (= (select main_a main_x) 39)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19657#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} is VALID [2019-05-15 10:40:43,155 INFO L273 TraceCheckUtils]: 81: Hoare triple {19657#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 961) (= (select main_a main_x) 40)))} a := a[y := a[y] - 1]; {19661#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,156 INFO L273 TraceCheckUtils]: 82: Hoare triple {19661#(or (and (= (select main_a main_x) 40) (= (select main_a main_y) 960)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19665#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} is VALID [2019-05-15 10:40:43,157 INFO L273 TraceCheckUtils]: 83: Hoare triple {19665#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 41) (= (select main_a main_y) 960)))} a := a[y := a[y] - 1]; {19669#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {19669#(or (and (= (select main_a main_y) 959) (= (select main_a main_x) 41)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19673#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} is VALID [2019-05-15 10:40:43,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {19673#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 959) (= (select main_a main_x) 42)))} a := a[y := a[y] - 1]; {19677#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,160 INFO L273 TraceCheckUtils]: 86: Hoare triple {19677#(or (and (= (select main_a main_x) 42) (= (select main_a main_y) 958)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19681#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} is VALID [2019-05-15 10:40:43,162 INFO L273 TraceCheckUtils]: 87: Hoare triple {19681#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 43) (= (select main_a main_y) 958)))} a := a[y := a[y] - 1]; {19685#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,163 INFO L273 TraceCheckUtils]: 88: Hoare triple {19685#(or (and (= (select main_a main_x) 43) (= (select main_a main_y) 957)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19689#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 44) (= (select main_a main_y) 957)))} is VALID [2019-05-15 10:40:43,164 INFO L273 TraceCheckUtils]: 89: Hoare triple {19689#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 44) (= (select main_a main_y) 957)))} a := a[y := a[y] - 1]; {19693#(or (and (= (select main_a main_y) 956) (= (select main_a main_x) 44)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,165 INFO L273 TraceCheckUtils]: 90: Hoare triple {19693#(or (and (= (select main_a main_y) 956) (= (select main_a main_x) 44)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19697#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 956) (= (select main_a main_x) 45)))} is VALID [2019-05-15 10:40:43,166 INFO L273 TraceCheckUtils]: 91: Hoare triple {19697#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_y) 956) (= (select main_a main_x) 45)))} a := a[y := a[y] - 1]; {19701#(or (and (= (select main_a main_y) 955) (= (select main_a main_x) 45)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,167 INFO L273 TraceCheckUtils]: 92: Hoare triple {19701#(or (and (= (select main_a main_y) 955) (= (select main_a main_x) 45)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} a := a[x := a[x] + 1]; {19705#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 46) (= (select main_a main_y) 955)))} is VALID [2019-05-15 10:40:43,168 INFO L273 TraceCheckUtils]: 93: Hoare triple {19705#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 46) (= (select main_a main_y) 955)))} a := a[y := a[y] - 1]; {19709#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 46) (= (select main_a main_y) 954)))} is VALID [2019-05-15 10:40:43,170 INFO L273 TraceCheckUtils]: 94: Hoare triple {19709#(or (and (= main_y main_x) (= (select main_a main_x) 1000)) (and (= (select main_a main_x) 46) (= (select main_a main_y) 954)))} a := a[x := a[x] + 1]; {19713#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 47) (= (select main_a main_y) 954)))} is VALID [2019-05-15 10:40:43,171 INFO L273 TraceCheckUtils]: 95: Hoare triple {19713#(or (and (= main_y main_x) (= (select main_a main_x) 1001)) (and (= (select main_a main_x) 47) (= (select main_a main_y) 954)))} a := a[y := a[y] - 1]; {19717#(or (and (= (select main_a main_x) 47) (= (select main_a main_y) 953)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} is VALID [2019-05-15 10:40:43,171 INFO L273 TraceCheckUtils]: 96: Hoare triple {19717#(or (and (= (select main_a main_x) 47) (= (select main_a main_y) 953)) (and (= main_y main_x) (= (select main_a main_x) 1000)))} assume x > y && a[x] == 1000; {19333#false} is VALID [2019-05-15 10:40:43,172 INFO L273 TraceCheckUtils]: 97: Hoare triple {19333#false} assume !(a[y] <= 0); {19333#false} is VALID [2019-05-15 10:40:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:40:43,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:40:43,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-15 10:40:43,207 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-05-15 10:40:43,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:40:43,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states. [2019-05-15 10:40:43,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:43,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-05-15 10:40:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-15 10:40:43,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2019-05-15 10:40:43,346 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states.